Branch-and-bound processing of ranked queries

Information Systems

Volumn 32, Issue 3, 2007, Pages 424-445

  Tao, Yufei ^a   Hristidis, Vagelis ^b   Papadias, Dimitris ^c   Papakonstantinou, Yannis ^d  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b FLORIDA INTERNATIONAL UNIVERSITY   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Branch and bound algorithms; Databases; R tree; Ranked queries

Indexed keywords

ALGORITHMS; DATA HANDLING; DATABASE SYSTEMS; DECISION MAKING; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT;

BRANCH AND BOUND ALGORITHMS; R TREE; RANKED QUERIES; SPACE EFFICIENT;

DATA PROCESSING;

EID: 33751440054     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2005.12.001     Document Type: Article

References (29)

1. Y. Chang, L. Bergman, V. Castelli, C. Li, M. Lo, J. Smith. The onion technique: indexing for linear optimization queries, ACM SIGMOD, 2000.
2. V. Hristidis, N. Koudas, Y. Papakonstantinou. PREFER: a system for the efficient execution of multi-parametric ranked queries, ACM SIGMOD, 2001.
3. P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, D. Srivastava. Ranked join indices, ICDE, 2003.
4. Hristidis V., and Papakonstantinou Y. Algorithms and applications for answering ranked queries using ranked views. VLDB J. 13 1 (2004) 49-70
5. A. Guttman, R-trees: a dynamic index structure for spatial searching, ACM SIGMOD, 1984.
6. N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, ACM SIGMOD, 1990.
7. Bruno N., Chaudhuri S., and Gravano L. Top-k selection queries over relational databases: mapping strategies and performance evaluation. TODS 27 2 (2002) 153-187
8. N. Bruno, L. Gravano, A. Marian, Evaluating top-k queries over web-accessible databases, ICDE, 2002.
9. I. Ilyas, W. Aref, A. Elmagarmid, Joining ranked inputs in practice, VLDB, 2002.
10. K. Chang, S.-W. Hwang, Minimal probing: supporting expensive predicates for top-k queries, SIGMOD, 2002.
11. N. Roussopoulos, S. Kelly, F. Vincent, Nearest neighbor queries, ACM SIGMOD, 1995.
12. Hjaltason G., and Samet H. Distance browsing in spatial databases. ACM TODS 24 2 (1999) 265-318
13. C. Böhm, H. Kriegel, Determining the convex hull in large multidimensional databases, DAWAK, 2001.
14. D. Kossmann, F. Ramsak, S. Rost, Shooting stars in the sky: an online algorithm for skyline queries, VLDB, 2002.
15. D. Papadias, Y. Tao, G. Fu, B. Seeger, An optimal and progressive algorithm for skyline queries, ACM SIGMOD, 2003.
16. R. Benetis, C. Jensen, G. Karciauskas, S. Saltenis, Nearest neighbor and reverse nearest neighbor queries for moving objects, IDEAS, 2002.
17. S. Berchtold, C. Böhm, D. Keim, H. Kriegel, A cost model for nearest neighbor search in high-dimensional data spaces, ACM PODS, 1997.
18. A. Papadopoulos, Y. Manolopoulos, Performance of nearest neighbor queries in R-trees, ICDT, 1997.
19. Boehm C. A cost model for query processing in high dimensional data spaces. ACM TODS 25 2 (2000) 129-178
20. Y. Theodoridis, T. Sellis, A model for the prediction of R-tree performance, ACM PODS, 1996.
21. M. Muralikrishna, D. DeWitt, Equi-depth histograms for estimating selectivity factors for multi-dimensional queries, ACM SIGMOD, 1988.
22. S. Acharya, V. Poosala, S. Ramaswamy, Selectivity estimation in spatial databases, ACM SIGMOD, 1999.
23. N. Bruno, L. Gravano, S. Chaudhuri, STHoles: a workload aware multidimensional histogram, ACM SIGMOD, 2001.
24. D. Gunopulos, G. Kollios, V. Tsotras, C. Domeniconi, Approximate multi-dimensional aggregate range queries over real attributes, ACM SIGMOD, 2000.
25. Press W., Flannery B., Teukolsky S., and Vetterling W. Numerical Recipes in C (2002), Cambridge University Press, Cambridge. 0-521-75033-4
26. Zipf G. Human Behaviour and the Principle of Least Effort: An Introduction to Human Ecology (1949), Addison-Wesley, Reading, MA
27. N. Katayama, S. Satoh, The SR-tree: an index structure for high-dimensional nearest neighbor queries, ACM SIGMOD, 1997.
28. S. Berchtold, D. Keim, H.P. Kriegel, The X-tree: an index structure for high-dimensional data, VLDB, 1996.
29. Y. Sakurai, M. Yoshikawa, S. Uemura, H. Kojima, The A-tree: an index structure for high-dimensional spaces using relative approximation, VLDB, 2000.