627 search results - page 74 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
265
click to vote
VLDB
2005
ACM
16 years 6 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...
194
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
200
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. We consider a collaboration of peers autonomously crawling the Web. A pivotal issue when designing a peer-to-peer (P2P) Web search engine in this environment is query rou...
191
click to vote
PRIS
2004
15 years 7 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
152
click to vote
ESWS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Efficiently detecting near duplicate resources is an important task when integrating information from various sources and applications. Once detected, near duplicate reso...