Efficient processing of regular path joins using PID

Jongik Kim

doi:10.1016/S0950-5849(02)00208-2

2003-04-01

PRE

Jongik Kim *

Hyoung-Joo Kim

DOI：10.1016/S0950-5849(02)00208-2

原文链接

原文求助

摘要

En 中文

XML is data that has no fixed structure. So it is hard to design a schema for storing and querying an XML data. Instead of a fixed schema, graph-based data models are widely adopted for querying XML. Queries on XML are based on paths in a data graph. A meaningful query usually has several paths in it, but much of recent research is more concerned with optimizing a single path in a query. In this paper, we present an efficient technique for processing multiple path expressions in a query. We implemented our technique and present preliminary performance results. (C) 2003 Elsevier Science B.V. All rights reserved.

Keyword:

XML query

multiple regular paths

path identifier