Sciweavers

2145 search results - page 290 / 429
» Pattern-Based Query Answering
Sort
View
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 9 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 9 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 9 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
ICDE
2010
IEEE
874views Database» more  ICDE 2010»
14 years 9 months ago
UV-Diagram: A Voronoi Diagram for Uncertain Data
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...
Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...