Fast High-Dimensional Data Search in Incomplete Databases
Summary: Two indexing schemes for incomplete, high-dimensional databases: BR-tree (bitstring-augmented R-tree) and MOSAIC (multi one-attribute indexes). BR-tree reduces update/storage costs and is often faster for range queries; MOSAIC excels on point queries and dimension-unrestricted ranges, with both beating exhaustive search. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Beng Chin Ooi
- 2. Cheng Hian Goh
- 3. Kian-Lee Tan
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,718 | GHOST: Fine Granularity Buffering of Index | 1999 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 24 | The R+-Tree: A Dynamic Index For Multi-Dimensional Objects | 1987 | VLDB | 0.00083378538 |
| 129 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.0004429571 |
| 284 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00028994728 |
| 575 | Distance-Based Indexing For High-Dimensional Metric Spaces | 1997 | SIGMOD | 0.00019882723 |
| 2,327 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB | 9.0276061e-05 |
| 2,570 | Extensible Buffer Management of Indexes | 1992 | VLDB | 8.5214777e-05 |
| 7,921 | Information Retrieval from an Incomplete Data Cube | 1996 | VLDB | 4.6161463e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,314 | Index Intersection for High-Dimensional Range Queries | 2026 | VLDB | 4.1945683e-05 |
| 9,207 | Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree | 2007 | CIDR | 4.3733038e-05 |
| 9,767 | Adaptive Indexing of Objects with Spatial Extent | 2023 | VLDB | 4.2856106e-05 |
| 7,777 | Indexing Mixed Types for Approximate Retrieval | 2005 | VLDB | 4.653704e-05 |
| 14,282 | Performance Comparison Of Index Structures For Multi-Key Retrieval | 1984 | SIGMOD | - |
| 1,182 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS | 0.00013455963 |
| 6,097 | Two-dimensional Substring Indexing | 2001 | PODS | 5.2119402e-05 |
| 12,294 | Worst-Case Efficient Range Search Indexing | 2009 | PODS | 4.1945683e-05 |
| 1,184 | On Effective Multi-Dimensional Indexing for Strings | 2000 | SIGMOD | 0.00013455208 |
| 6,480 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0475112e-05 |