Sciweavers

262 search results - page 31 / 53
» XML keyword query refinement
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 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
CIKM
2004
Springer
13 years 11 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
WIDM
2004
ACM
14 years 1 months ago
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
Carina F. Dorneles, Carlos A. Heuser, Andrei E. N....
PLANX
2008
13 years 9 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
DMSN
2009
ACM
14 years 2 months ago
Extracting tennis statistics from wireless sensing environments
Creating statistics from sporting events is now widespread with most efforts to automate this process using various sensor devices. The problem with many of these statistical app...
Adel Shaeib, Kenneth Conroy, Mark Roantree