168,462 Hits in 6.5 sec

A sorting approach to indexing spatial data

Hanan Samet
2008 ACM SIGGRAPH 2008 classes on - SIGGRAPH '08  
The traditional role of the index is to sort the data, which means that it orders the data.  ...  what is usually done is to sort the spatial objects with respect to the space that they occupy.  ...  Acknowledgments I am deeply grateful to Jagan Sankaranarayanan for help with the figures and preparation for publication.  ... 
doi:10.1145/1401132.1401250 dblp:conf/siggraph/Samet08a fatcat:elzlw3pavzbpnizfq4sww2v53i

A Sorting Approach to Indexing Spatial Data

2008 International journal of shape modeling  
The handling of queries that involve spatial data is facilitated by building an index on the data. The traditional role of the index is to sort the data, which means that it orders the data.  ...  what is usually done is to sort the spatial objects with respect to the space that they occupy.  ...  Acknowledgments I am deeply grateful to Jagan Sankaranarayanan for help with the figures and preparation for publication.  ... 
doi:10.1142/s021865430800104x fatcat:5exypmfcebfnreflcfs56bpyzi

A Unified Approach for Indexed and Non-indexed Spatial Joins [chapter]

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter
2000 Lecture Notes in Computer Science  
Orenstein [29] uses a transformational approach based on space-filling curves, and then performs a sort-merge join along the curve to solve the join problem.  ...  model to decide when to follow an index-based approach.  ...  Rotem [32] proposes a spatial join algorithm based on the join index of Valduriez [37] and a grid file. Spatial Index-Based Approaches.  ... 
doi:10.1007/3-540-46439-5_29 fatcat:m7acmsicanahtehh5qdf33nk74


Mirjana Pavlovic, Farhan Tauheed, Thomas Heinis, Anastasia Ailamakit
2013 Proceedings of the 25th International Conference on Scientific and Statistical Database Management - SSDBM  
State-of-the-art dataoriented spatial join approaches (e.g., based on the R-Tree) suffer from degraded performance due to overlap, whereas space-oriented approaches excessively read data from disk.  ...  At the same time it avoids the overlap related problems associated with data-oriented partitioning by using a crawling approach, i.e., without using a hierarchical tree.  ...  GIPSY indexes the dense dataset with a data-oriented approach and avoids overlap through crawling: the sparse datasets are used to crawl through the index of the dense dataset.  ... 
doi:10.1145/2484838.2484855 dblp:conf/ssdbm/PavlovicTHA13 fatcat:u7fzz6ol45euvf7gosfirrcs2q

Efficient Quadtree Construction for Indexing Large-Scale Point Data on GPUs: Bottom-Up vs. Top-Down

Jianting Zhang, Le Gruenwald
2019 International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures  
In addition to sorting points to be indexed only once based on their Morton codes, our proposed bottom-up approach adopts a data parallel design and parallel primitive based implementation, which makes  ...  In this study, we introduce a new bottom-up approach to constructing quadtrees for indexing large-scale point data on GPUs, which is significantly different from previous works that typically adopt a top-down  ...  Among various parallel primitives we have exploited, sorting plays a key role in spatial indexing to move spatially adjacent points close to each other and generate indices for the underlying data.  ... 
dblp:conf/adms/ZhangG19 fatcat:7d7b4f43sva4vkzmnsk5b3eaha

GCUBE Indexing

Laxmaiah M, Govardhan A
2013 International Journal of Data Mining & Knowledge Management Process  
Providing spatial information to the data warehouse (DW); two major challenges faced are;1.Defining and Aggregation of Spatial/Continues values and 2.Representation, indexing, updating and efficient query  ...  We employed the proposed approach storing and indexing using synthetic and real data sets and evaluated its build, update and Query time.  ...  BASIC APPROACH The objective of this paper is to address the issue of the representation and indexing of mixed data is a ROLAP setting.  ... 
doi:10.5121/ijdkp.2013.3406 fatcat:qwa66mbwonbgjh5zaxnzh6gqpy

Hands-off Model Integration in Spatial Index Structures [article]

Ali Hadian, Ankit Kumar, Thomas Heinis
2020 arXiv   pre-print
Spatial indexes are crucial for the analysis of the increasing amounts of spatial data, for example generated through IoT applications.  ...  In this paper we thus explore the opportunity to use light-weight machine learning models to accelerate queries on spatial indexes.  ...  We take a different approach that does not need data transformation: sorting based on one of the existing dimensions.  ... 
arXiv:2006.16411v2 fatcat:32c27kr555erbghggbaslzt7py

Spatial join techniques

Edwin H. Jacox, Hanan Samet
2007 ACM Transactions on Database Systems  
To overcome these problems, a spatial join is typically performed using a two stage filter-and-refine approach [Orenstein 1989b ].  ...  The computational geometry approach to solving the simplified spatial join (a two-set rectangle intersection) is to use a plane-sweep technique [Preparata and Shamos 1985] (see Section 3.1).  ...  Another approach, if only one dataset is indexed, is to consider the index as a source of sorted or partitioned data and use the techniques for performing a spatial join when neither dataset is indexed  ... 
doi:10.1145/1206049.1206056 fatcat:jek64fxt7rar7mxjqrby33n5ki

Parallel online spatial and temporal aggregations on multi-core CPUs and many-core GPUs

Jianting Zhang, Simin You, Le Gruenwald
2014 Information Systems  
In this study, we report our designs, implementations and experiments on developing a data management platform and a set of parallel techniques to support highperformance online spatial and temporal aggregations  ...  After spatially associating points with road segments, spatial, temporal and spatiotemporal aggregations are reduced to relational aggregations and can be processed in the order of a fraction of a second  ...  Camille Kamga at CUNY City College for providing the NYC taxi trip data and Dr. Hongmian Gong at CUNY Hunter College for insightful discussions on urban applications of GPS data.  ... 
doi:10.1016/ fatcat:y43k2qlcqrg6lnt5ryitfnpahy

Speeding up bulk-loading of quadtrees

Gísli R. Hjaltason, Hanan Samet, Yoram J. Sussmann
1997 Proceedings of the fifth ACM international workshop on Advances in geographic information systems - GIS '97  
We investigate the issue of speeding up building PMR quadtrees for a set of objects and develop two approaches to achieve this goal.  ...  Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins.  ...  Sorting a set of objects prior to insertion is a small price to pay, as it is usually a much less expensive process than the cost of building the spatial index.  ... 
doi:10.1145/267825.267839 dblp:conf/gis/HjaltasonSS97 fatcat:vq6ykhmr6zfhjfi4u6dzh52vxe

Deep integration of spatial query processing into native RDF triple stores

Andreas Brodt, Daniela Nicklas, Bernhard Mitschang
2010 Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '10  
Semantic Web technologies, most notably RDF, are wellsuited to cope with typical challenges in spatial data management including analyzing complex relations between entities, integrating heterogeneous  ...  We model spatial features in RDF as literals of a complex geometry type and express spatial predicates as SPARQL filter functions on this type.  ...  Acknowledgments We would like to thank Bastian Reitschuster, Tim Waizenegger, Oliver Schiller and Nazario Cipriani for greatly supporting our work.  ... 
doi:10.1145/1869790.1869799 dblp:conf/gis/BrodtNM10 fatcat:agqdkbd4hbc6ziiahyjqi4hu5u

A scalable approach for index in generic location-aware rank query

Utharn Buranasaksee
2021 International Journal of Intelligent Information and Database Systems  
After that, the sparse ordered set is proposed to reduce the index construction time. Finally, the external attribute-based IR-tree sort algorithm is proposed to solve the scalability issues.  ...  As location-aware information becomes more popular, many researchers have been proposed many effective approaches to solving the problem.  ...  The other approach is the spatial-first approach. This approach creates an index structure that is based on the spatial index first.  ... 
doi:10.1504/ijiids.2021.112079 fatcat:ulfmkjj6vfbqvngzkljnrlge3e

A Parallel SPH Implementation on Multi-Core CPUs

Markus Ihmsen, Nadir Akinci, Markus Becker, Matthias Teschner
2010 Computer graphics forum (Print)  
In the context of neighborhood queries, the paper presents optimizations for two efficient instances of uniform grids, i. e. spatial hashing and index sort.  ...  This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method.  ...  Index sort is another approach to reduce the memory consumption and transfer of the uniform grid. Index sort first sorts the particles with respect to their cell indices c.  ... 
doi:10.1111/j.1467-8659.2010.01832.x fatcat:gyq4fyrkirc5lcfoydv56ttvcy

Efficient Parallel Zonal Statistics on Large-Scale Global Biodiversity Data on GPUs

Jianting Zhang, Simin You, Le Gruenwald
2015 Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data - BigSpatial'15  
with 4+ million vertices on a single Nvidia Quadro 6000 GPU device.  ...  In this study, we have developed efficient techniques to enable parallel zonal statistics on the global GBIF data completely on GPUs with limited memory capacity.  ...  The results suggest that the FSG approach is superior to the MLQ approach for spatially joining large scale datasets. Therefore, the FSG approach is adopted in this study for point indexing.  ... 
doi:10.1145/2835185.2835187 dblp:conf/gis/ZhangYG15 fatcat:m4onsutjr5b3pjmhevztb2exo4

Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
1997 Very Large Data Bases Conference  
We also present an experimental evaluation of the proposed optimizations as well as a performance comparison between BFRJ and the state-of-the-art approach.  ...  At each level, BFRJ creates an intermediate join index and deploys global optimization strategies (ordering, memory management, buffer management) to improve the join computation at the next level.  ...  We would like to thank all students in the University of Michigan Database Group (UMDG) for their help and suggestions for this work and its presentation.  ... 
dblp:conf/vldb/HuangJR97 fatcat:u5ngugckxne47o74z7ijfdfnqq
« Previous Showing results 1 — 15 out of 168,462 results