C-tree: efficient cell-based indexing of indoor mobile objects

摘要: With the increasing popularity of indoor positioning system technologies, many applications have become available that allow moving objects to be monitored and queried on basis their locations. At center these is a data structure used for indexing objects. For most current applications, based certain modifications methods from established research area in outdoor spaces. But approach spaces should more radically different. The nature spaces, which essentially consist cells connections between cells, concept cell-based adjacency, as opposed metric-based require significantly different focus approach. In this paper, we present index structure, called C-tree (‘C’ ‘cell’), efficiently grouping managing updates can serve spatial queries, topological adjacency queries density-based queries. addition, shown density play an important role performance structure. Taking cell into account, extend application construct what tree, substantially improves when space contains high cells.