Sciweavers

479 search results - page 26 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
DATESO
2009
146views Database» more  DATESO 2009»
13 years 7 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas
WWW
2003
ACM
14 years 9 months ago
XCQ: XML Compression and Querying System
We present our development of an XML compression and querying tool, which is called XML Compression and Querying System (XCQ). This system is developed based on a novel technique ...
Wai Yeung Lam, Wilfred Ng, Peter T. Wood, Mark Lev...
EDBT
2006
ACM
106views Database» more  EDBT 2006»
14 years 9 months ago
DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 10 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
IS
2010
13 years 7 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...