785 search results - page 26 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper introduces a framework for processing continuous, exact queries over continuous update XML streams. Instead of eagerly performing the updates on cached portions of the s...
WEBDB
2010
Springer
13 years 6 months ago
2010
Springer
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
ADBIS
2000
Springer
14 years 12 days ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
GEOINFO
2003
13 years 10 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
EDBT
2011
ACM
13 years 9 days ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...