CIS-X: A compacted indexing scheme for efficient query evaluation of XML documents

Hsu, Wen-Chiao; Liao, I‐En

doi:10.1016/j.ins.2013.03.055

Cited by 14 publications

(8 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some studies combine the structural summary scheme and query evaluation algorithm to provide better query processing, such as TwigX-Guide [22], CIS-X [13], and MatchQTP [40]. TwigX-Guide constructs the DataGuide and converts it into a DG index table, which is used to evaluate input queries using TwigStack.…”

Section: Indexing and Query Evaluationmentioning

confidence: 99%

“…The shortcomings of TwigStack, which produces useless intermediate results and requires an expensive merging phase, have not been resolved. For more details on the challenges faced when applying structural summary methods and query evaluation methods, please refer to our previous work [13]. A good index structure must reduce the costs associated with time and space and must support complex queries.…”

Section: Indexing and Query Evaluationmentioning

confidence: 99%

“…Because the tree structure is inefficient for partial matching in most cases, the index tree is stored as a pair of hash tables, which are called UCIS-X. We use an algorithm similar to CIS-X for structural summarization (see Algorithm 1: Index-Construction in [13]). The differences between the two are the labeling schemes and the information stored in the hash tables.…”

Section: A Index Constructionmentioning

confidence: 99%

“…In addition, branch map can extract information and update operations efficiently. UCIS-X is an improved version of CIS-X [13]. It adopts a branch map that can support updating operations on XML documents.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

UCIS-X: An Updatable Compact Indexing Scheme for Efficient Extensible Markup Language Document Updating and Query Evaluation

Hsu

Liao

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

One of the difficulties faced when using XML as the data storage structure is query inefficiency. Therefore, various indexing methods have been proposed. When designing indexing methods, the first step is to choose the labeling method. Some labeling methods can work well; however, if they cannot effectively support update operations, their use is subject to considerable limitations. Most of the update-friendly labeling methods proposed in the literature assign a unique label to each node in XML and provide an expandable mechanism for future insertion. However, they encounter some difficulties, such as increasing the index space, more difficulty in evaluating the relationships between nodes, and increasing the complexity of labels. In this paper, we introduce a novel update-friendly labeling scheme called branch map, which records the correspondence between parent and child nodes instead of assigning a label to each node. The space required for the index is reduced considerably. More importantly, the branch map can maintain the profile as if it was encoded initially, even after being frequently updated. This paper also proposes a compact indexing scheme called UCIS-X. Experimental results indicate that UCIS-X performs well in terms of index size, query, and update efficiency.

show abstract

Section: Indexing and Query Evaluationmentioning

confidence: 99%

Section: Indexing and Query Evaluationmentioning

confidence: 99%

Section: A Index Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

UCIS-X: An Updatable Compact Indexing Scheme for Efficient Extensible Markup Language Document Updating and Query Evaluation

Hsu

Liao

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…They show that their model is scalable and evaluates queries in sub-second time. Hsu et al [8] propose a technique known as CIS-X to index XML documents. The idea is to build a summary tree for the XML data tree which will be regarded as the index of the XML document.…”

Section: Related Workmentioning

confidence: 99%

Triple Indexing: An Efficient Technique for Fast Phrase Query Evaluation

Gugnani¹,

Roul²

2014

IJCA

View full text Add to dashboard Cite

Phrase query evaluation is an important task of every search engine. Optimizing the query evaluation time for phrase queries is the biggest threat for the current search engine. Usually, phrase queries are a hassle for standard indexing techniques. This is generally because, merging the posting lists and checking the word ordering takes a lot of time. This paper proposes a new technique called Triple Indexing to index web documents which optimizes query evaluation time for phrase queries by reducing the time for merging the posting lists and checking the word ordering. In addition, a proper procedure has been put forward for document ranking using an extended vector space model. The 4 Universities dataset and Industry Sector dataset of Carnegie Mellon University has been used for experimental purpose and it has been found that using the proposed method with a modern machine, the query time for phrase queries is reduced by almost 50 percent, compared to a standard inverted index.

show abstract

Evolving an Algorithm to Generate Sparse Inverted Index Using Hadoop and Pig

Sharma

Singh

2016

Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Volume 2

View full text Add to dashboard Cite

CIS-X: A compacted indexing scheme for efficient query evaluation of XML documents

Cited by 14 publications

References 26 publications

UCIS-X: An Updatable Compact Indexing Scheme for Efficient Extensible Markup Language Document Updating and Query Evaluation

UCIS-X: An Updatable Compact Indexing Scheme for Efficient Extensible Markup Language Document Updating and Query Evaluation

Triple Indexing: An Efficient Technique for Fast Phrase Query Evaluation

Evolving an Algorithm to Generate Sparse Inverted Index Using Hadoop and Pig

Contact Info

Product

Resources

About