486 search results - page 50 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
106
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
189
click to vote
VLDB
2005
ACM
16 years 1 months ago
2005
ACM
Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which acce...
192
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
216
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
115
click to vote
VLDB
1998
ACM
15 years 5 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...