785 search results - page 29 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
DEXA
2005
Springer
14 years 2 months ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
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...
EDBT
2006
ACM
13 years 10 months ago
2006
ACM
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...