Sciweavers

709 search results - page 2 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
PPDP
2010
Springer
13 years 3 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
PVLDB
2008
146views more  PVLDB 2008»
13 years 5 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
14 years 5 months ago
Efficient Evaluation of XML Middle-ware Queries
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
13 years 3 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
PVLDB
2008
81views more  PVLDB 2008»
13 years 5 months ago
On efficiently searching trajectories and archival data for historical similarities
We study the problem of efficiently evaluating similarity queries on histories, where a history is a d-dimensional time
Reza Sherkat, Davood Rafiei