{"title":"多维数据的紧致希尔伯特指数","authors":"Chris H. Hamilton, A. Rau-Chaplin","doi":"10.1109/CISIS.2007.16","DOIUrl":null,"url":null,"abstract":"Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these \"inflated\" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (parallel, P2P and grid), in which not only is memory space saved but communication volume reduced","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Compact Hilbert Indices for Multi-Dimensional Data\",\"authors\":\"Chris H. Hamilton, A. Rau-Chaplin\",\"doi\":\"10.1109/CISIS.2007.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these \\\"inflated\\\" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (parallel, P2P and grid), in which not only is memory space saved but communication volume reduced\",\"PeriodicalId\":328547,\"journal\":{\"name\":\"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISIS.2007.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIS.2007.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compact Hilbert Indices for Multi-Dimensional Data
Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these "inflated" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (parallel, P2P and grid), in which not only is memory space saved but communication volume reduced