Sciweavers

514 search results - page 55 / 103
» Answer Sets for Consistent Query Answering in Inconsistent D...
Sort
View
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 5 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
15 years 10 days ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 10 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
ICDT
2012
ACM
235views Database» more  ICDT 2012»
12 years 1 months ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
VLDB
2008
ACM
178views Database» more  VLDB 2008»
14 years 11 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis