511 search results - page 26 / 103 » Approximate Selection Queries over Imprecise Data |
168
click to vote
PVLDB
2010
15 years 4 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
161
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
159
click to vote
DEXA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In relational database management systems indexes are used to accelerate specific queries. The selection of indexes is an important task when tuning a database which is ...
174
click to vote
AAAI
2007
15 years 8 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
294
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...