Development of an object-oriented DBMS
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
The ObjectStore database system
Communications of the ACM
On the performance of object clustering techniques
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
WWW '99 Proceedings of the eighth international conference on World Wide Web
On the Optimality of the Probability Ranking Scheme in Storage Applications
Journal of the ACM (JACM)
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
XML recently has expanded its application areas: data formats in various information systems, communication protocols in distributed systems, and so on. Generally, XML data can be logically modeled as rooted tree. For the query processing of such data, path queries are widely used. In this paper, we present an optimal algorithm that places XML data on disks such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. First, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion, and in the next step we map the nodes to disk blocks using the assigned number. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set.