Parallel Query Processing Algorithms for Semi-structured Data

Authors:
Wenjun Sun;Kevin Lü
Affiliations:
-;-
Venue:
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Year:
2002

Citing 3
Cited 1

Object Exchange Across Heterogeneous Information Sources

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Query Optimization for XML

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Capturing and Querying Multiple Aspects of Semistructured Data

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases

Managing highly correlated semi-structured data: architectural aspects of a digital archive

Proceedings of the ACM first Ph.D. workshop in CIKM

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semi-structured data can be described by a labelled directed graph. Query costs on semi-structured data could be very high due to the sequential processing of path matching in a graph shape data structure. In this paper two types of parallel path-based query processing methods are introduced for improving the system performance. The first type includes three parallel version of pointer chasing methods based on the principle of message-driven computation. In the second type of method, the pre-fetch technique is used to achieve a low communication cost and a high degree of parallelisation.