Sciweavers

3241 search results - page 180 / 649
» Searching for Hidden-Web Databases
Sort
View
125
Voted
CIKM
2006
Springer
15 years 7 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
16 years 5 months ago
Outsourcing Search Services on Private Spatial Data
Social networking and content sharing service providers, e.g., Facebook and Google Maps, enable their users to upload and share a variety of user-generated content, including locat...
Man Lung Yiu, Gabriel Ghinita, Christian S. Jensen...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
226
Voted
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 3 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
196
Voted
VLDB
2008
ACM
131views Database» more  VLDB 2008»
16 years 3 months ago
Primal or dual: which promises faster spatiotemporal search?
The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gaine...
Yufei Tao, Xiaokui Xiao