4438 search results - page 62 / 888 » Speculative Query Processing |
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 ...
EDBT
1998
ACM
14 years 1 months ago
1998
ACM
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
ESWS
2011
Springer
13 years 15 days ago
2011
Springer
Driven by the success of the Linked Open Data initiative today’s Semantic Web is best characterized as a Web of interlinked datasets. Hand in hand with this structure new challen...
SEKE
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
IPM
2006
13 years 9 months ago
2006
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...