hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.20532/cit.2017.1003557

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

Dhanalekshmi Gopinathan ; Department of Computer Science, Jaypee Institute of Information Technology, Noida, Uttar Pradesh, India
Krishna Asawa

Fulltext: english, pdf (798 KB) pages 211-225 downloads: 208* cite
APA 6th Edition
Gopinathan, D. & Asawa, K. (2017). New Path Based Index Structure for Processing CAS Queries over XML Database. Journal of computing and information technology, 25 (3), 211-225. https://doi.org/10.20532/cit.2017.1003557
MLA 8th Edition
Gopinathan, Dhanalekshmi and Krishna Asawa. "New Path Based Index Structure for Processing CAS Queries over XML Database." Journal of computing and information technology, vol. 25, no. 3, 2017, pp. 211-225. https://doi.org/10.20532/cit.2017.1003557. Accessed 14 Nov. 2019.
Chicago 17th Edition
Gopinathan, Dhanalekshmi and Krishna Asawa. "New Path Based Index Structure for Processing CAS Queries over XML Database." Journal of computing and information technology 25, no. 3 (2017): 211-225. https://doi.org/10.20532/cit.2017.1003557
Harvard
Gopinathan, D., and Asawa, K. (2017). 'New Path Based Index Structure for Processing CAS Queries over XML Database', Journal of computing and information technology, 25(3), pp. 211-225. https://doi.org/10.20532/cit.2017.1003557
Vancouver
Gopinathan D, Asawa K. New Path Based Index Structure for Processing CAS Queries over XML Database. Journal of computing and information technology [Internet]. 2017 [cited 2019 November 14];25(3):211-225. https://doi.org/10.20532/cit.2017.1003557
IEEE
D. Gopinathan and K. Asawa, "New Path Based Index Structure for Processing CAS Queries over XML Database", Journal of computing and information technology, vol.25, no. 3, pp. 211-225, 2017. [Online]. https://doi.org/10.20532/cit.2017.1003557

Abstracts
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 don't have 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.

Keywords
XML; query processing; CAS query; WWW; index; XPath; database storage

Hrčak ID: 188347

URI
https://hrcak.srce.hr/188347

Visits: 271 *