Sciweavers

511 search results - page 11 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 10 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
SSD
2007
Springer
132views Database» more  SSD 2007»
15 years 11 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
SEMWEB
2010
Springer
15 years 3 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 5 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald