Sciweavers

3341 search results - page 117 / 669
» On Bounded Queries and Approximation
Sort
View
ICDT
1995
ACM
101views Database» more  ICDT 1995»
15 years 1 months ago
Approximation in Databases
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
Leonid Libkin
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
15 years 1 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
WWW
2007
ACM
15 years 10 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham
ICDE
2007
IEEE
205views Database» more  ICDE 2007»
15 years 11 months ago
Multi-source Skyline Query Processing in Road Networks
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
Ke Deng, Xiaofang Zhou, Heng Tao Shen
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
15 years 10 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias