3341 search results - page 261 / 669 » On Bounded Queries and Approximation |
304
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
271
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Long running decision support queries can be resource intensive and often lead to resource contention in data warehousing systems. Today, the only real option available to the DBA...
171
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
179
click to vote
BNCOD
2008
15 years 8 months ago
2008
Abstract. We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network ...
213
click to vote
DLOG
2006
15 years 8 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...