Abstract
Tree structure metric-space indexing methods recursively partition data according to their distances to a set of selected reference points (also called pivots). There are two basic forms of data partitioning: ball partition and General Hyper-plane (GH) partition. Most existing work only shows their superiority experimentally, and little theoretical proof is found. We propose an approach to unify existing data partitioning methods and analyze their performance theoretically. First, in theory, we unify the two basic forms of partitioning by proving that there are rotations of each other. Second, we show several theoretical or experimental results, which are able to indicate that ball partition outperforms GH partition. Our work takes a step forward in the theoretical study of metric-space indexing and is able to give a guideline of future index design.
Original language | English |
---|---|
Title of host publication | Database Systems for Advanced Applications : 19th International Conference, DASFAA 2014, Bali, Indonesia, April 21-24, 2014. Proceedings, Part I |
Editors | Sourav S. BHOWMICK, Curtis E. DYRESON , Christian S. JENSEN , Mong Li LEE , Agus MULIANTARA , Bernhard THALHEIM |
Place of Publication | Springer |
Pages | 141-155 |
Number of pages | 15 |
DOIs | |
Publication status | Published - 2014 |
Externally published | Yes |
Event | The 19th International Conference on Database Systems for Advanced Applications - Aerowisata Sanur Beach Hotel, Bali, Indonesia Duration: 21 Apr 2014 → 24 Apr 2014 https://www.comp.nus.edu.sg/~dasfaa14/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Verlag |
ISSN (Print) | 0302-9743 |
Conference
Conference | The 19th International Conference on Database Systems for Advanced Applications |
---|---|
Abbreviated title | DASFAA 2014 |
Country | Indonesia |
City | Bali |
Period | 21/04/14 → 24/04/14 |
Internet address |
Keywords
- data partitioning
- metric-space access method
- pivot space model