{"title":"为有效处理XML树模式查询应用广泛的约束","authors":"D. Che, Yipeng Liu","doi":"10.1109/NWESP.2005.19","DOIUrl":null,"url":null,"abstract":"Efficient query optimization is critical to the performance of query processing in a database system. The same is true for XML databases and queries. XML queries naturally carry a tree-shaped search pattern which usually contains redundancies. Efficient minimization of the tree patterns of XML queries forms an integral and important part of XML query optimization. This short paper sketchily presents our approach for XML tree pattern query minimization that explores a variety of XML constraints.","PeriodicalId":433802,"journal":{"name":"International Conference on Next Generation Web Services Practices (NWeSP'05)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Applying broad constraints for efficient processing of XML tree pattern queries\",\"authors\":\"D. Che, Yipeng Liu\",\"doi\":\"10.1109/NWESP.2005.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient query optimization is critical to the performance of query processing in a database system. The same is true for XML databases and queries. XML queries naturally carry a tree-shaped search pattern which usually contains redundancies. Efficient minimization of the tree patterns of XML queries forms an integral and important part of XML query optimization. This short paper sketchily presents our approach for XML tree pattern query minimization that explores a variety of XML constraints.\",\"PeriodicalId\":433802,\"journal\":{\"name\":\"International Conference on Next Generation Web Services Practices (NWeSP'05)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Next Generation Web Services Practices (NWeSP'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NWESP.2005.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Next Generation Web Services Practices (NWeSP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NWESP.2005.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Applying broad constraints for efficient processing of XML tree pattern queries
Efficient query optimization is critical to the performance of query processing in a database system. The same is true for XML databases and queries. XML queries naturally carry a tree-shaped search pattern which usually contains redundancies. Efficient minimization of the tree patterns of XML queries forms an integral and important part of XML query optimization. This short paper sketchily presents our approach for XML tree pattern query minimization that explores a variety of XML constraints.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
