Loading...
Loading...

Go to the content (press return)

Partial match queries in relaxed multidimensional search trees

Author
Martinez, C.; Pahnholzer, A.; Prodinger, H.
Type of activity
Report
Date
1998-10
Code
R98-53
Repository
http://hdl.handle.net/2117/84777 Open in new window
Abstract
Partial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is a K-tuple of values. The components of a key are called the coordinates or attributes of the key. In a partial match query we specify the value of s attributes, 0 < s < K, and leave the remaining K - s attributes unspecified. The goal is to retrieve all the records in the database that match the specified attributes. In this pape...
Citation
Martinez, C., Pahnholzer, A., Prodinger, H. "Partial match queries in relaxed multidimensional search trees". 1998.
Keywords
Multidimensional search trees, Partial match queries
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments