Sciweavers

2853 search results - page 101 / 571
» On the Efficiency of Provenance Queries
Sort
View
CIKM
2004
Springer
15 years 10 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 10 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
STACS
2010
Springer
16 years 1 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 6 months ago
BioScout: a life-science query monitoring system
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 7 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...