Efficient XML Retrieval Service with Complete Path Representation

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...

Full description

Saved in:
Bibliographic Details
Published inIEICE transactions on information and systems Vol. E96.D; no. 4; pp. 906 - 917
Main Authors Chang, Hsu-Kuang, Hung, King-Chu, Jou, I-Chang
Format Journal Article
LanguageJapanese
Published 2013
Subjects
Data search
Extensible Markup Language
Indexing
Preserves
Queries
Representations
Semantics
XML
Online AccessGet full text

Cover

More Information
Summary: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 to provide 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 searches. An experiment is also conducted for the evaluation of the CPR approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.E96.D.906