Variable-depth trie index optimization: theory and experimental results

We develop an efficient approach to Trie index optimization. A Trie is a data structure used to index a file having a set of attributes as record identifiers. In the proposed methodology, a file is horizontally partitioned into subsets of records using a Trie index whose depth of indexing is allowed...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ACM transactions on database systems 1989-03, Vol.14 (1), p.41-74
Hauptverfasser:	Ramesh, R., Babu, A. J. G., Kincaid, J. Peter
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences B-trees Computer science control theory systems Contextual software domains Data structures design and analysis Design and analysis of algorithms Directory structures Discrete mathematics Document representation Exact sciences and technology File systems management Graph theory Information retrieval Information retrieval query processing Information storage systems Information systems Information systems. Data bases Linked lists Mathematics of computing Memory organisation. Data processing Operating systems Record storage alternatives Record storage systems Software Software and its engineering Software organization and properties Sorting and searching Theory of computation Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!