{"title":"使用智能路径派生优化分析数据库的XML-to-SQL查询转换","authors":"Mustafa Atay, P. Fisher","doi":"10.1145/1900008.1900050","DOIUrl":null,"url":null,"abstract":"We introduce the idea of an XML-to-SQL translation scheme applicable to relatively stable databases in this paper. This approach utilizes a subordinate data structure which we call a Path Prefix Tree (PPT). The PPT is updated for each instance of the XML document, and then used to build efficient SQL queries that are nearly optimal in terms of efficiency. The mapping of XML path expressions into SQL queries is shown to operate in O(n) time. Moreover, our proposed XML-to-SQL translation scheme efficiently maps the recursive path queries to SQL queries in the presence of recursive schemas using the PPT.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimizing XML-to-SQL query translation for analytical databases using intelligent path derivation\",\"authors\":\"Mustafa Atay, P. Fisher\",\"doi\":\"10.1145/1900008.1900050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce the idea of an XML-to-SQL translation scheme applicable to relatively stable databases in this paper. This approach utilizes a subordinate data structure which we call a Path Prefix Tree (PPT). The PPT is updated for each instance of the XML document, and then used to build efficient SQL queries that are nearly optimal in terms of efficiency. The mapping of XML path expressions into SQL queries is shown to operate in O(n) time. Moreover, our proposed XML-to-SQL translation scheme efficiently maps the recursive path queries to SQL queries in the presence of recursive schemas using the PPT.\",\"PeriodicalId\":333104,\"journal\":{\"name\":\"ACM SE '10\",\"volume\":\"126 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SE '10\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1900008.1900050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SE '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1900008.1900050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimizing XML-to-SQL query translation for analytical databases using intelligent path derivation
We introduce the idea of an XML-to-SQL translation scheme applicable to relatively stable databases in this paper. This approach utilizes a subordinate data structure which we call a Path Prefix Tree (PPT). The PPT is updated for each instance of the XML document, and then used to build efficient SQL queries that are nearly optimal in terms of efficiency. The mapping of XML path expressions into SQL queries is shown to operate in O(n) time. Moreover, our proposed XML-to-SQL translation scheme efficiently maps the recursive path queries to SQL queries in the presence of recursive schemas using the PPT.