Sciweavers

481 search results - page 42 / 97
» Approximate XML Query Answers
Sort
View
FQAS
2006
Springer
76views Database» more  FQAS 2006»
13 years 11 months ago
Why Using Structural Hints in XML Retrieval?
Abstract. When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural leve...
Karen Sauvagnat, Mohand Boughanem, Claude Chrismen...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 8 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
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 8 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
2010
ACM
164views Database» more  EDBT 2010»
13 years 11 months ago
Techniques for efficiently querying scientific workflow provenance graphs
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
Manish Kumar Anand, Shawn Bowers, Bertram Ludä...