Partial match retrieval in implicit data structures (Q800083): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Searching Semisorted Tables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3917501 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multidimensional binary search trees used for associative searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit Data Structures for the Dictionary Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit data structures for fast search and update / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial-Match Retrieval Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Should Tables Be Sorted? / rank | |||
Normal rank |
Revision as of 15:55, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partial match retrieval in implicit data structures |
scientific article |
Statements
Partial match retrieval in implicit data structures (English)
0 references
1984
0 references
We consider partial match retrieval in implicit data structures. Consider a set of n records of k attributes each. This set is to be stored in an n by k array such that partial match retrieval can be done efficiently. A partial match query specifies a subset of the attributes, say s attributes, and asks for all tuples in the set agreeing with the query in the set of specified attributes. The complexity of this problem is studied in the paper and matching upper and lower bounds are shown. The model of computation is the comparison model.
0 references
data management
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
optimal algorithms
0 references
partial match retrieval
0 references
implicit data structures
0 references
partial match query
0 references
complexity
0 references
lower bounds
0 references
comparison model
0 references
0 references