论文信息 - Towards Top-k Query Answering in Deductive Databases

Towards Top-k Query Answering in Deductive Databases

In this paper we address a novel issue for deductive databases with huge data repositories, namely the problem of evaluating ranked top-k queries. The problem occurs whenever we allow queries such as "find cheap hotels close to the conference location" in which fuzzy predicates like cheap and close occur. We show how to compute efficiently the top-k answers of conjunctive queries with fuzzy predicates.

Umberto Straccia | Umberto Straccia | U. Straccia

[1] E. F. Codd,et al. Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[2] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[3] Jeffrey D. Uuman. Principles of database and knowledge- base systems , 1989 .

[4] Letizia Tanca,et al. Logic Programming and Databases , 1990, Surveys in Computer Science.

[5] David Scott Warren,et al. Memoing for logic programs , 1992, CACM.

[6] Serge Abiteboul,et al. Foundations of Databases , 1994 .

[7] Jeffrey D. Ullman,et al. A survey of deductive database systems , 1995, J. Log. Program..

[8] Werner Kießling,et al. Optimizing Multi-Feature Queries for Image Databases , 2000, VLDB.

[9] Ronald Fagin,et al. Combining fuzzy information: an overview , 2002, SGMD.

[10] Seung-won Hwang,et al. Minimal probing: supporting expensive predicates for top-k queries , 2002, SIGMOD '02.

[11] Moni Naor,et al. Optimal aggregation algorithms for middleware , 2001, PODS.

[12] James Harland,et al. An introduction to deductive database languages and systems , 1994, The VLDB Journal.

[13] Kevin Chen-Chuan Chang,et al. RankSQL: query algebra and optimization for relational top-k queries , 2005, SIGMOD '05.

[14] Seung-won Hwang,et al. Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates , 2007, IEEE Transactions on Knowledge and Data Engineering.