{"title":"支持XML文档的分支版本","authors":"Zografoula Vagena, Mirella M. Moro, V. Tsotras","doi":"10.1109/RIDE.2004.1281713","DOIUrl":null,"url":null,"abstract":"Many e-commerce and e-government applications are collaborative in nature (e.g. negotiation and e-catalog management). In collaborative environments, users typically define new document versions from any past version, which creates the need for supporting multiversion XML documents, particularly branched versioning. In this paper, we address the problem of evaluating path expression queries over XML documents with branched versions. We extend path joins to work in a branched version environment and to allow queries on multiple versions. We propose a storage scheme that efficiently maintains all branched document versions and describe changes required on Pathstack, an optimal pattern matching algorithm. Finally, we investigate the effectiveness of our techniques through experimental evaluation.","PeriodicalId":143695,"journal":{"name":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Supporting branched versions on XML documents\",\"authors\":\"Zografoula Vagena, Mirella M. Moro, V. Tsotras\",\"doi\":\"10.1109/RIDE.2004.1281713\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many e-commerce and e-government applications are collaborative in nature (e.g. negotiation and e-catalog management). In collaborative environments, users typically define new document versions from any past version, which creates the need for supporting multiversion XML documents, particularly branched versioning. In this paper, we address the problem of evaluating path expression queries over XML documents with branched versions. We extend path joins to work in a branched version environment and to allow queries on multiple versions. We propose a storage scheme that efficiently maintains all branched document versions and describe changes required on Pathstack, an optimal pattern matching algorithm. Finally, we investigate the effectiveness of our techniques through experimental evaluation.\",\"PeriodicalId\":143695,\"journal\":{\"name\":\"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.2004.1281713\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th International Workshop Research Issues on Data Engineering: Web Services for e-Commerce and e-Government Applications, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.2004.1281713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Many e-commerce and e-government applications are collaborative in nature (e.g. negotiation and e-catalog management). In collaborative environments, users typically define new document versions from any past version, which creates the need for supporting multiversion XML documents, particularly branched versioning. In this paper, we address the problem of evaluating path expression queries over XML documents with branched versions. We extend path joins to work in a branched version environment and to allow queries on multiple versions. We propose a storage scheme that efficiently maintains all branched document versions and describe changes required on Pathstack, an optimal pattern matching algorithm. Finally, we investigate the effectiveness of our techniques through experimental evaluation.