Name
Abstract | ||
|---|---|---|
Hyperspheres are commonly used for representing uncertain objects (in uncertain databases) and for indexing spatial objects (in spatial databases). An interesting operator on hyperspheres called dominance is to decide for two given hyperspheres whether one dominates (or is closer than) the other wrt a given query hypersphere. In this paper, we propose an approach called Hyperbola which is optimal in the sense that it gives neither false positives nor false negatives and runs in linear time wrt the dimensionality. To the best of our knowledge, Hyperbola is the first optimal approach for the dominance problem on hyperespheres with any dimensionality. We also study an application of the dominance problem which relies on the dominance operator as the core component. We conducted extensive experiments on both real and synthetic datasets which verified our approaches. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2588555.2593669 | SIGMOD Conference |
Keywords | Field | DocType |
hyperbola,hypersphere dominance,pruning,spatial databases and gis | Data mining,Pattern recognition,Computer science,Algorithm,Search engine indexing,Hypersphere,Curse of dimensionality,Hyperbola,Operator (computer programming),Artificial intelligence,Time complexity,False positive paradox | Conference |
Citations | PageRank | References |
1 | 0.35 | 28 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheng Long | 1 | 194 | 23.70 |
| Raymond Chi-Wing Wong | 2 | 1305 | 85.98 |
| Bin Zhang | 3 | 3 | 0.72 |
| Min Xie | 4 | 20 | 7.20 |