610 search results - page 77 / 122 » Efficient Query Evaluation on Probabilistic Databases |
140
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. We propose a mediator model for providing integrated and unified access to multiple taxonomy-based sources. Each source comprises a taxonomy and a database that indexes o...
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
104
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...