The organization of a multilist-type associative memory

Prywes, Noah S.; Gray, Harry J.

doi:10.1109/tce.1963.6373250

Cited by 11 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several well-known index structures for text indexing have been proposed. These structures include suffix trees [26,32,47], suffix binary search trees [28], suffix arrays [20,26,31], inverted files [38], tries [21,35], B-trees [8,16], and the prefix B-tree [9]. Several variants of these structures have been proposed to efficiently index strings of unbounded length.…”

Section: Related Workmentioning

confidence: 99%

The SBC-tree

Eltabakh

Hon

Shah

et al. 2008

Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

Run-Length-Encoding (RLE) is a data compression technique that is used in various applications, e.g., time series, biological sequences, and multimedia databases. One of the main challenges is how to operate on (e.g., index, search, and retrieve) compressed data without decompressing it. In this paper, we introduce the String B-tree for Compressed sequences, termed the SBC-tree, for indexing and searching RLE-compressed sequences of arbitrary length. The SBCtree is a two-level index structure based on the well-known String B-tree and a 3-sided range query structure [7]. The SBC-tree supports pattern matching queries such as substring matching, prefix matching, and range search operations over RLE-compressed sequences. The SBC-tree has an optimal external-memory space complexity of O(N/B) pages, where N is the total length of the compressed sequences, and B is the disk page size. Substring matching, prefix matching, and range search execute in an optimal O(log B N + |p|+T B ) I/O operations, where |p| is the length of the compressed query pattern and T is the query output size. The SBC-tree is also dynamic and supports insert and delete operations efficiently. The insertion and deletion of all suffixes of a compressed sequence of length m take O(m log B (N + m)) amortized I/O operations. The SBC-tree index is realized inside PostgreSQL. Performance results illustrate that using the SBC-tree to index RLEcompressed sequences achieves up to an order of magnitude reduction in storage, while retains the optimal search performance achieved by the String B-tree over the uncompressed sequences.

show abstract

Section: Related Workmentioning

confidence: 99%

The SBC-tree

Eltabakh

Hon

Shah

et al. 2008

Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

show abstract

“…Figure 2 describes the threaded list organization. A threaded list organization is known also as multilist [16,17] and knotted list [24].…”

Section: Ddtldddm Dddddddddmentioning

confidence: 99%

“…The columns of each figure correspond to particular database organizations, that is, those represented by levels A through D. Also, the curves Joining levels A through D represent the three settings of query complexity along with combinations of database organizations between inverted lists and threaded lists (-) and between inverted lists and cellular lists (-). These combinations of query streams and databases are considered adequate in the light of Lowe's work [17], which used the same combinations. The distributions are not to be thought of as parameters since they are varied only to support the experimental conclusions.…”

Section: The Model and Its Assumptionsmentioning

confidence: 99%

A stochastic evaluation model for database organizations in data retrieval systems

Siler

1976

Commun. ACM

View full text Add to dashboard Cite

Experimental work in the valuation of large scale data retrieval systems has been scarce due to its difficulty and prohibitive cost. This paper discusses a simulation model of a data retrieval system which has the effect of significantly reducing the cost of experimentation and enabling research never attempted before. The model is designed to estimate the retrieval workload of alternative data retrieval systems. These data retrieval systems can be organized under several database organizations, including inverted list, threaded list, and cellular list organizations and hybrid combinations of these systems. Effectiveness of the methodology is demonstrated by using the model to study the effect of database organizations in data retrieval systems. In particular, the impact of query complexity is analyzed.

show abstract

“…Several interesting applicatioiLs with multilist files have appeared in [2,7,10] and applications with inverted files can be found in [9] and index-sequential files in [31. RECEIVED APRIL, 1969;REVISED JUNE, 1969 …”

Section: Two Retrieval Algorithmsmentioning

confidence: 99%

A formal system for information retrieval from files

1970

View full text Add to dashboard Cite

A generalized file structure is provided by which the concepts of keyword, index, record, file, direcfory, file structure, directory decoding, and record retrieval are defined and from which some of the frequently used file structures such as inverted files, index-sequential files, and multilist files are derived.Two algorithms which retrieve records from the generalized file structure are presented.KEY WORDS AND PHRASESr attribule-volue pair, index, keyword, record, record address, K-pointer, K-Iisl, file, directory, generalized file structure, inverted file, index-sequential-file, multilist file, description, file search, directory search, serial processing of lists, prime keyword, parallel processing of lists CR CATEGORIES: 3.70, 3.73, 3.74The object is to develop a formal approacli to the characterization and classification of file structures with a view toward information retrieval. To this end, we first develop definitions. All the abstract concepts to be introduced stem from the real world and are so illustrated. The construction of a generalized file structure to embrace some of the known file organizations and a general algorithm for parallel processing of lists are believed to be new. File StructureDConsider two undefined terms: a set A of "attributes" and a set V of "values." A record J? is a subset of the Cartesian product A X V in which each attribute has one and only one value. Thus fl is a set of ordered pairs of the form: (an attribute, its value).

show abstract

The organization of a multilist-type associative memory

Cited by 11 publications

References 0 publications

The SBC-tree

The SBC-tree

A stochastic evaluation model for database organizations in data retrieval systems

A formal system for information retrieval from files

Contact Info

Product

Resources

About