Vagelis Hristidis
ABSTRACT
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operations' research and applied mathematics as well as everyday life; e.g., a buyer may select a home as a weighted function of a number of attributes like its distance from office, its price, its area, etc.
We capture such queries in our definition of preference queries that use a weight function over a relation's attributes to derive a score for each tuple. Database systems cannot efficiently produce the top results of a preference query because they need to evaluate the weight function over all tuples of the relation. PREFER answers preference queries efficiently by using materialized views that have been pre-processed and stored.
We first show how the result of a preference query can be produced in a pipelined fashion using a materialized view. Then we show that excellent performance can be delivered given a reasonable number of materialized views and we provide an algorithm that selects a number of views to precompute and materialize given space constraints.
We have implemented the algorithms proposed in this paper in a prototype system called PREFER, which operates on top of a commercial database management system. We present the results of a performance comparison, comparing our algorithms with prior approaches using synthetic datasets. Our results indicate that the proposed algorithms are superior in performance compared to other approaches, both in preprocessing (preparation of materialized views) as well as execution time.
- 1.Y. S. A. Levy, A. Mendelzon and D. Srivastava. Answering Queries Using Views. PODS, pages 95-104, 1995. Google Scholar
Digital Library
- 2.R. Agrawal and E. Wimmers. A Framework For Expressing and Combining Preferences. Proceedings of ACM SIGMOD, pages 297-306, June 2000. Google ScholarDigital Library
- 3.Y. chi Chang, L. Bergman, V. Castelli, C. Li, M. L. Lo, and J. Smith. The Onion Technique: Indexing for Linear Optimization Queries. Proceedings of ACM SIGMOD, pages 391-402, June 2000. Google ScholarDigital Library
- 4.S. Cohen, W. Nutt, and A. Serebrenik. Rewriting Aggregate Queries Using Views. PODS, pages 155-166, 1999. Google ScholarDigital Library
- 5.H. V. j. D. Srivastava, S. Dar and A. Levy. Answering Queries with Aggregation Using Views. Proceedings of VLDB, pages 318-329, 1996. Google ScholarDigital Library
- 6.O. Duschka and M. Genesereth. Answering Recursive Queries Using Views. PODS, pages 109-116, 1997. Google ScholarDigital Library
- 7.R. Fagin. Combining Fuzzy Information from Multiple Systems. PODS, pages 216-226, June 1996. Google ScholarDigital Library
- 8.R. Fagin. Fuzzy Queries In Multimedia Database Systems. PODS, pages 1-10, June 1998. Google ScholarDigital Library
- 9.R. Fagin and E. Wimmers. Incorporating User Preferences in Multimedia Queries. ICDT, pages 247-261, Jan. 1997. Google ScholarDigital Library
- 10.A. Guttman. R-trees : A Dynamic Index Structure for Spatial Searching. Proceedings of ACM SIGMOD, pages 47-57, June 1984. Google ScholarDigital Library
- 11.D. Hockbaum. Approximation Algorithms for NP-Hard Problems. ITP, 1997. Google ScholarDigital Library
- 12.C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover. Google ScholarDigital Library
- 13.Y. Papakonstantinou and V. Vassalos. Query Rewriting For Semistructured Data. Proceedings of ACM SIGMOD, pages 455-466, 1999. Google ScholarDigital Library
- 14.T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ -tree : A Dynamic Index for Multi-dimensional Data. Proceedings of VLDB 1987, pages 507-518, Sept. 1987. Google ScholarDigital Library
- 15.V. Vassalos and Y. Papakonstantinou. Expressive Capabilities, Description Languages and Query Rewriting Algorithms. JLP, 2000.Google Scholar
Index Terms
- PREFER: a system for the efficient execution of multi-parametric ranked queries
Recommendations
PREFER: a system for the efficient execution of multi-parametric ranked queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operations' research and applied mathematics as well as everyday life; e.g., a ...
Volition Learning: What Would You Prefer to Prefer?
Artificial Intelligence in HCIAbstractWhen queried, humans do not always give their utmost attention to provide their best possible answer. In particular, they may give different answers to the same question, depending on their level of concentration and interest. This raises a ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments