Practical preference relations for large data sets

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 229-236

  Ross, Kenneth A ^a   Stuckey, Peter J ^b   Marian, Amelie ^c  

^a Columbia University ^*

^b UNIVERSITY OF MELBOURNE   (Australia)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ENGINEERING; DECLARATIVE SPECIFICATION; INDEX STRUCTURES; INTERNATIONAL CONFERENCES; LARGE DATA SETS; PARTIAL ORDERS; PREFERENCE QUERIES; PREFERENCE RELATIONS; QUERY RESULTS; TRANSITIVE CLOSURES; USER PREFERENCES;

CHLORINE COMPOUNDS; LINGUISTICS; TECHNOLOGY;

DATA STRUCTURES;

EID: 48349096156     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2007.4400997     Document Type: Conference Paper

References (14)

1. R. Agrawal and E. L. Wimmers. A framework for expressing and combining preferences. In SIGMOD Conference, 2000.
2. S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In IEEE Conf. on Data Engineering, 2001.
3. J. Chomicki. Preference formulas in relational queries. ACM Trans. Database Syst., 28(4), 2003.
4. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. In SODA, 2003.
5. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614-656, 2003.
6. R. Fagin and E. L. Wimmers. A formula for incorporating weights into scoring rules. Theor. Comput. Sci., 239(2):309-338, 2000.
7. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. J. Comput. Syst. Sci., 51(1), 1995.
8. W. Kießling. Foundations of preferences in database systems. In VLDB, 2002.
9. W. Kießling and G. Kösller. Preference SQL - design, implementation, experiences. In VLDB, pages 990-1001, 2002.
10. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
11. O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. In SSTD, 2003.
12. J. T. Robinson. The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In SIGMOD Conference, pages 10-18, New York, NY, USA, 1981. ACM Press.
13. K. A. Ross. On the adequacy of partial orders for preference composition. In DBRank, 2007.
14. K. A. Ross, P. J. Stuckey, and A. Marian. Practical preference relations for large data sets. Technical Report CUCS-028-06, Columbia University, 2006. Available at http://mice.cs.columbia.edu/research/publications.