Preference-driven query processing

Author

Eng, Pin-Kwang ; Ooi, Beng Chin ; Sim, Hua Soon ; Tan, Kian-Lee

Author_Institution

Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore

fYear

2003

fDate

5-8 March 2003

Firstpage

671

Lastpage

673

Abstract

We propose a partition-based framework for evaluating preference queries. The framework is independent of how partitions are generated, and returns answers progressively as the query is being evaluated. We evaluated the framework using partitions obtained from the leaf nodes of R-trees. Our study shows that our approach can shorten the initial response time.

Keywords

database management systems; information retrieval system evaluation; query processing; R-trees; database management systems; information retrieval system evaluation; leaf nodes; partition-based framework; preference-driven query processing; Cities and towns; Computer science; Database systems; Delay; Query processing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 2003. Proceedings. 19th International Conference on

Print_ISBN

0-7803-7665-X

Type

conf

DOI

10.1109/ICDE.2003.1260830

Filename

1260830

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2507452