Sciweavers

219 search results - page 12 / 44
» Intensional Query Answering: An Application of Partial Evalu...
Sort
View
DAGSTUHL
1998
15 years 1 months ago
A Practical Approach to Hypothetical Database Queries
Hypothetical queries are queries embedding hypotheses about the database. The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for...
Henning Christiansen, Troels Andreasen
PAKDD
2004
ACM
83views Data Mining» more  PAKDD 2004»
15 years 5 months ago
Providing Diversity in K-Nearest Neighbor Query Results
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
Anoop Jain, Parag Sarda, Jayant R. Haritsa
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 1 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 1 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 3 months ago
Interactive query refinement
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...
Chaitanya Mishra, Nick Koudas