{"title":"递归XML数据查询的有效处理","authors":"N. Alghamdi, J. Rahayu, E. Pardede","doi":"10.1109/AINA.2015.177","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"99 1","pages":"134-142"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Processing of Queries over Recursive XML Data\",\"authors\":\"N. Alghamdi, J. Rahayu, E. Pardede\",\"doi\":\"10.1109/AINA.2015.177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":6845,\"journal\":{\"name\":\"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops\",\"volume\":\"99 1\",\"pages\":\"134-142\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2015.177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2015.177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Processing of Queries over Recursive XML Data
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.