A complete path representation method with a modified inverted index for efficient retrieval of XML documents

Authors:
Hsu-Kuang Chang;King-Chu Hung;I-Chang Jou
Affiliations:
Department of Information Engineering, I-Shou University, Kaohsiung City, Taiwan, R.O.C. and Department of Electronic Engineering, National Kaohsiung First University of Science and Technology, Ka ...;Department of Electronic Engineering, National Kaohsiung First University of Science and Technology, Kaohsiung City, Taiwan, R.O.C.;Department of Information Engineering, I-Shou University, Kaohsiung City, Taiwan, R.O.C.
Venue:
WSEAS Transactions on Computers
Year:
2011

Citing 24
Cited 0

Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Preparations for Semantics-Based XML Mining

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
TreeFinder: a First Step towards XML Data Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure

IEEE Transactions on Knowledge and Data Engineering
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
XML Clustering by Principal Component Analysis

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Fast Detection of XML Structural Similarity

IEEE Transactions on Knowledge and Data Engineering
Learning the Kernel Matrix for XML Document Clustering

EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
Determining the Complexity of XML Documents

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
From region encoding to extended dewey: on efficient processing of XML twig pattern matching

VLDB '05 Proceedings of the 31st international conference on Very large data bases
XML Document Indexes: A Classification

IEEE Internet Computing
XML Document Clustering Using Common XPath

WIRI '05 Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Node labeling schemes for dynamic XML documents reconsidered

Data & Knowledge Engineering
XML structural delta mining: issues and challenges

Data & Knowledge Engineering - Special issue: ER 2003
An efficient infrastructure for native transactional XML processing

Data & Knowledge Engineering
Improving the Results and Performance of Clustering Bit-encoded XML Documents

ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
XML Processing and Data Integration with XQuery

IEEE Internet Computing
S3: Evaluation of tree-pattern XML queries supported by structural summaries

Data & Knowledge Engineering
An Improved XML Document Clustering Using Path Feature

FSKD '08 Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
A methodology for clustering XML documents by structure

Information Systems
Twiglist: make twig pattern matching fast

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Clustering XML documents using structural summaries

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compiling documents in extensible markup language (XML) increasingly requires access to data services which provide both rapid response and the precise use of search engines. Efficient data service should be based on a skillful representation that can support low complexity and high precision search capabilities. In this paper, a novel complete path representation (CPR) associated with a modified inverted index is presented for the provision of efficient XML data services, where queries can be versatile in terms of predicates. CPR can completely preserve hierarchical information, and the new index is used to save semantic information. The CPR approach can provide template-based indexing for fast data search. An experiment is also conducted for the evaluation of the CPR approach.