Sciweavers

104 search results - page 3 / 21
» Query ranking in probabilistic XML data
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 5 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
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 8 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 7 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
CIKM
2009
Springer
13 years 8 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett