J. Muthuraj, Sharma Chakravarthy, R. Varadarajan, S. Navathe
{"title":"分布式数据库设计中垂直分区问题的形式化方法","authors":"J. Muthuraj, Sharma Chakravarthy, R. Varadarajan, S. Navathe","doi":"10.1109/PDIS.1993.253076","DOIUrl":null,"url":null,"abstract":"The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived. The objective function derived provides a basis for developing heuristic algorithms for vertical partitioning. The objective function is also useful for comparing previously proposed algorithms for vertical partitioning. The current implementation status of a testbed is indicated.<<ETX>>","PeriodicalId":147994,"journal":{"name":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","volume":"11 19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"A formal approach to the vertical partitioning problem in distributed database design\",\"authors\":\"J. Muthuraj, Sharma Chakravarthy, R. Varadarajan, S. Navathe\",\"doi\":\"10.1109/PDIS.1993.253076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived. The objective function derived provides a basis for developing heuristic algorithms for vertical partitioning. The objective function is also useful for comparing previously proposed algorithms for vertical partitioning. The current implementation status of a testbed is indicated.<<ETX>>\",\"PeriodicalId\":147994,\"journal\":{\"name\":\"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems\",\"volume\":\"11 19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDIS.1993.253076\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDIS.1993.253076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A formal approach to the vertical partitioning problem in distributed database design
The n-ary vertical partitioning problem is addressed, and an objective function that generalizes and subsumes earlier work is derived. The objective function derived provides a basis for developing heuristic algorithms for vertical partitioning. The objective function is also useful for comparing previously proposed algorithms for vertical partitioning. The current implementation status of a testbed is indicated.<>