Sciweavers

109 search results - page 13 / 22
» Example-driven design of efficient record matching queries
Sort
View
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
15 years 10 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni
WWW
2006
ACM
15 years 10 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
GIR
2006
ACM
15 years 3 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
OTM
2005
Springer
15 years 3 months ago
An Efficient Trajectory Index Structure for Moving Objects in Location-Based Services
Because moving objects usually moves on spatial networks, efficient trajectory index structures are required to gain good retrieval performance on their trajectories. However, ther...
Jae-Woo Chang, Jung-Ho Um, Wang-Chien Lee
80
Voted
SIGIR
2002
ACM
14 years 9 months ago
Finding relevant documents using top ranking sentences: an evaluation of two alternative schemes
In this paper we present an evaluation of techniques that are designed to encourage web searchers to interact more with the results of a web search. Two specific techniques are ex...
Ryen White, Ian Ruthven, Joemon M. Jose