792 search results - page 61 / 159 » Computing Iceberg Queries Efficiently |
155
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
EDBT
2002
ACM
15 years 10 months ago
2002
ACM
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
EDBT
2006
ACM
15 years 1 months ago
2006
ACM
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
113
click to vote
DEBS
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...