Sciweavers

78 search results - page 8 / 16
» Finding Top-k Approximate Answers to Path Queries
Sort
View
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 8 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 8 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 7 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 8 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 7 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman