P-Cube: Answering preference queries in multi-dimensional space

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1092-1100

  Xin, Dong ^a   Han, Jiawei ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DATA COMPRESSION; DATA PROCESSING; DECISION MAKING; LIFE CYCLE; PROBLEM SOLVING; QUERY PROCESSING; SEARCH ENGINES; TECHNOLOGY;

BOOLEAN PREDICATES; BOOLEAN PRUNING; DATA CUBES; DATA ENGINEERING; DATABASE SEARCHES; INCREMENTAL MAINTENANCE; INTERNATIONAL CONFERENCES; MULTI-DIMENSIONAL; MULTI-DIMENSIONAL SPACES; NEW APPLICATIONS; ORDER-OF MAGNITUDES; PERFORMANCE STUDY; PREFERENCE ANALYSIS; PREFERENCE QUERIES; SIGNATURE GENERATION; SKYLINE QUERYING; SPEED UPS; UNIFIED FRAMEWORK;

BOOLEAN FUNCTIONS;

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

References (21)

1. J. Chomicki, "Preference queries," CoRR, vol. cs.DB/0207093, 2002.
2. S. Borzsonyi, D. Kossmann, and K. Stocker, "The skyline operator," in ICDE. 2001, pp. 421-430.
3. K. C.-C. Chang and S. won Hwang, "Minimal probing; Supporting expensive predicates for top-k queries," in SIGMOD Conference, 2002, pp. 346-357.
4. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS, 2001.
5. M. J. Carey and D. Kossmann, "On saying "Enough already!" in SQL," in SIGMOD Conference. 1997, pp. 219-230.
6. I. F. Ilyas. R. Shah, W. G. Aref, J. S. Vitter, and A. K. Elmagarmid, "Rank-aware query optimization," in SIGMOD Conference, 2004, pp. 203-214.
7. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with presorting," in ICDE. 2003, pp. 717-816.
8. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky; An online algorithm for skyline queries." in VLDB, 2002, pp. 275-286.
9. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive skyline computation in database systems," ACM Trans. Database Syst., vol. 30. no. 1. pp. 41-82, 2005.
10. K.-L. Tan, P.-K. Eng, and B. C. Ooi, "Efficient progressive skyline computation." in VLDB, 2001, pp. 301-310.
11. S. Churdhuri and U. Dayal, "An overview of dala warehousing and data cube." SIGMOD Record, vol. 26, pp. 65-74, 1997.
12. D. Xin, J. Han, H. Cheng, and X. Li, "Answering top-k queries with multi-dimensional selections: The ranking cube approach," in VLDB. 2006, pp. 463-475.
13. Z. Zhang, S.-W. Hwang, K. C.-C. Chang, M. Wang, C. A. Lang, and Y.-C. Chang. "Boolean + ranking; querying a database by k-constrained optimization." in SIGMOD Conference, 2006, pp. 359-370.
14. D. Xin, J. Han, and K. C.-C. Chang, "Progressive and selective merge; Computing top-k with ad-hoc ranking functions ," in SIGMOD Conference, 2007, pp. 103-114.
15. A. Guttman, "R-tree: A dynamic index structure for spatial searching," in SIGMOD Conference, Boston. MA, June 1984, pp. 47-57.
16. N. Beckmann. H.-P. Kriegel. R. Schneider, and B. Seeger, 'The R*-tree.: An efficient and robust access method for points and rectangles," in SIGMOD Conference. 1990, pp. 322-331.
17. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002.
18. A. Fraenkel and S. Klein, "Novel compression of sparse bit-strings -preliminary .report," Combinatorial Alg. on Words. NATO ASI Series, vol. 12, pp. 169-183, 1985.
19. X. Li, J. Han, and H. Gonzalez, "High-dimensional olap: A minimal cubing approach," in VLDB, 2004, pp. 528-539.
20. B. H. Bloom, "Space/time tradeoffs in hash coding with allowable errors," Comm. ACM, vol. 13, no. 7, pp. 422-426, 1970.
21. C. Bohm and H.-P. Kriegel, "Determining the convex hull in large multidimensional databases," in DaWaK. Springer-Verlag, 2001, pp. 294-306.