Extending path summary and region encoding for efficient structural query processing in native XML databases

Haw, Su-Cheng; Lee, Chien‐Sing

doi:10.1016/j.jss.2009.01.007

Cited by 30 publications

(16 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, the uniform expression of constraints is a prerequisite for conflict detection. The powerful ability of eXtensible Markup Language (XML) to describe and present data has been recognized as the standard for electronic data interchange in a multi-disciplinary domain [19][20][21]. In this paper, we express the constraints in the XML format.…”

Section: A Description Of the Constraints Setmentioning

confidence: 99%

A Conflict Detection Method Based on Constraint Satisfaction in Collaborative Design

Yang¹,

Zhao³

et al. 2015

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

Hierarchical constraints and constraint satisfaction were analyzed in order to solve the problem of conflict detection in collaborative design. The constraints were divided into two sets: one set consisted of known constraints and the other of unknown constraints. The constraints of the two sets were detected with corresponding methods. The set of the known constraints was detected using an interval propagation algorithm, a back propagation (BP) neural network was proposed to detect the set with the unknown constraints. An immune algorithm (IA) was utilized to optimize the weights and the thresholds of the BP neural network, and the steps were designed for the optimization process. The results of the simulation indicated that the BP neural network that was optimized by IA has a better performance in terms of convergent speed and global searching ability than a genetic algorithm. The constraints were described using the eXtensible Markup Language (XML) for computers to be able to automatically recognize and establish the constraint network. The implementation of the conflict detection system was designed based on constraint satisfaction. A wind planetary gear train is taken as an example of collaborative design with a conflict detection system. Category: Smart and intelligent computing

show abstract

Section: A Description Of the Constraints Setmentioning

confidence: 99%

A Conflict Detection Method Based on Constraint Satisfaction in Collaborative Design

Yang¹,

Zhao³

et al. 2015

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

show abstract

“…Our approach is able to detect this recursion when producing the final result. Various experiments are performed to compare OTQ ℜ , TwigX-Guide [12], TwigStack [10]. All three approaches were implemented using C#.…”

Section: Etstatus-based Filtermentioning

confidence: 99%

Efficient Processing of Queries over Recursive XML Data

Alghamdi

Rahayu

Pardede

2015

2015 IEEE 29th International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

This paper presents an object-based method for indexing recursive structured XML data and process branched queries efficiently. The proposed method is called Object-based Twig Query processing for Recursive data (OTQ ℜ ). It is an extended approach of our existing work in [1] in order to handle recursion in XML data. Our motivation of extending OTQ to OTQ ℜ is to support many applications that require recursive data structure to be fully functional. OTQ ℜ is proposed to utilize semantics of XML data to efficiently process branched queries on recursive XML data. The experiments and evaluation are presented to cover variant evaluating points and the efficiency of our approach.

show abstract

“…In [1], the indexing scheme processes the simple path query without branches. The indexing scheme [2] supports structural queries without any value predicates. The indexing scheme with Root Path and Data Path indexes [3] evaluates XML twig queries with value predicates.…”

Section: Introductionmentioning

confidence: 99%

New Path Based Index Structure for Processing CAS Queries over XML Database

Gopinathan

Asawa

2017

CIT

View full text Add to dashboard Cite

Querying nested data has become one of the most challenging issues for retrieving desired information from the Web. Today diverse applications generate a tremendous amount of data in different formats. These data and information exchanged on the Web are commonly expressed as nested representation such as XML, JSON, etc. Unlike the traditional database system, they do not possess a rigid schema. In general, the nested data is managed by storing data and its structures separately which significantly reduces the performance of data retrieving. Ensuring efficiency of processing queries which locates the exact positions of the elements has become a big challenging issue. There are different indexing structures which have been proposed in the literature to improve the performance of the query processing on the nested structure. Most of the past researches on nested structure concentrate on the structure alone. This paper proposes new index structure which combines siblings of the terminal nodes as one path which efficiently processes twig queries with less number of lookups and joins. The proposed approach is compared with some of the existing approaches. The results also show that they are processed with better performance compared to the existing ones. ACM CCS (2012) Classification

show abstract

Extending path summary and region encoding for efficient structural query processing in native XML databases

Cited by 30 publications

References 33 publications

A Conflict Detection Method Based on Constraint Satisfaction in Collaborative Design

A Conflict Detection Method Based on Constraint Satisfaction in Collaborative Design

Efficient Processing of Queries over Recursive XML Data

New Path Based Index Structure for Processing CAS Queries over XML Database

Contact Info

Product

Resources

About