Sciweavers

3020 search results - page 246 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
16 years 6 days ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
CIDR
2009
129views Algorithms» more  CIDR 2009»
15 years 7 months ago
Extracting and Querying a Comprehensive Web Database
Recent research in domain-independent information extraction holds the promise of an automatically-constructed structured database derived from the Web. A query system based on th...
Michael J. Cafarella
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 6 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu