Sciweavers

210 search results - page 4 / 42
» On Efficient Part-match Querying of XML Data
Sort
View
JSS
2008
139views more  JSS 2008»
13 years 8 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
ADC
2007
Springer
193views Database» more  ADC 2007»
14 years 3 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong
VLDB
2008
ACM
206views Database» more  VLDB 2008»
14 years 9 months ago
TopX: efficient and versatile top- k query processing for semistructured data
Recent IR extensions to XML query languages
Martin Theobald, Holger Bast, Debapriyo Majumdar, ...
CIKM
2004
Springer
14 years 2 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 10 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...