Sciweavers

1388 search results - page 65 / 278
» Querying Linguistic Trees
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 20 days 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
DEXA
2005
Springer
138views Database» more  DEXA 2005»
15 years 6 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 1 months ago
Put a Tree Pattern in Your Algebra
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
George A. Mihaila, Jérôme Simé...
134
Voted
MOBIQUITOUS
2005
IEEE
15 years 6 months ago
Decentralizing Query Processing in Sensor Networks
Recent research has led to the advent of software systems capable of performing query processing in sensor networks. They perform query processing in a sensor network by construct...
Ross Rosemark, Wang-Chien Lee
ACL
2010
14 years 10 months ago
Convolution Kernel over Packed Parse Forest
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
Min Zhang, Hui Zhang, Haizhou Li