Dominant graph: An efficient indexing structure to answer top-K queries

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 536-545

  Zou, Lei ^a   Chen, Lei ^b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST ACCOUNTING; GALERKIN METHODS; GRAPH THEORY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; TECHNOLOGY;

CARDINALITY; COST ANALYSIS; DATA ENGINEERING; GRAPH TRAVERSAL; HIGH DIMENSIONS; INDEXING STRUCTURES; INTERNATIONAL CONFERENCES; OPTIMIZATION TECHNIQUES; QUERY EFFICIENCY; SCORE FUNCTION; SEARCH EFFICIENCY; SEARCH SPACES; TOP-K QUERIES;

SET THEORY;

EID: 52649092321     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497462     Document Type: Conference Paper

References (25)

1. D. Xin, C. Chen, and J. Han, "Towards robust indexing for ranked queries." in VLDB, 2006.
2. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS, 2001.
3. S. Nepal and M. V. Ramakrishna, "Query processing issues in image (multimedia) databases." in ICDE, 1999.
4. U. Güntzer, W.-T. Balke, and W. Kießling, "Optimizing multi-feature queries for image databases." in VLDB, 2000.
5. Y.-C. Chang, L. D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith, "The Onion technique: Indexing for linear optimization queries." in SIGMOD, 2000.
6. V. Hristidis, N. Koudas, and Y. Papakonstantinou, "Prefer: A system for the efficient execution of multi-parametric ranked queries." in SIGMOD, 2001.
7. G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis, "Answering top-k queries using views." in VLDB, 2006.
8. S. Böizsönyi, D. Kossmann, and K. Stocker, "The skyline operator." in ICDE, 2001.
9. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An optimal and progressive algorithm for skyline queries." in SIGMOD, 2003.
10. K.-L. Tan, P.-K. Eng, and B. C. Ooi, "Efficient progressive skyline computation." 2001.
11. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: An online algorithm for skyline queries." 2002.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms. The MIT Press, 2001.
13. S. Chaudhuri, N. N. Dalvi, and R. Kaushik, "Robust cardinality and cost estimation for skyline operator." in ICDE, 2006.
14. P. Godfrey, "Skyline cardinality for relational processing." in FoIKS, 2004.
15. J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
16. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, "The quickhull algorithm for convex hulls," ACM Trans. on Mathematical Software, 1996.
17. D. Xin, J. Han, H. Cheng, and X. Li, "Answering top-k queries with multi-dimensional selections: The ranking cube approach." in VLDB, 2006.
18. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum, "IO-Top-k: Index-access optimized top-k query processing." in VLDB, 2006.
19. N. Mamoulis, K. H. Cheng, M. L. Yiu, and D. W. Cheung, "Efficient aggregation of ranked inputs." in ICDE, 2006.
20. N. Bruno, S. Chaudhuri, and L. Gravano, "Top-k selection queries over relational databases: Mapping strategies and performance evaluation," ACM TODS, 2002.
21. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid, "Supporting top-k join queries in relational databases." in VLDB, 2003.
22. C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song, "Ranksql: Query algebra and optimization for relational top-k queries." in SIGMOD, 2005.
23. W. Jin, M. Ester, and J. Han, "Efficient processing of ranked queries with sweeping selection." in PKDD, 2005.
24. K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen, "Efficient maintenance of materialized top-k views." in ICDE, 2003.
25. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k query processing in uncertain databases," in ICDE, 2007.