Filters








27,546 Hits in 1e+01 sec

IRSJ: incremental refining spatial joins for interactive queries in GIS

Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
2009 Geoinformatica  
In this paper, we propose a new interactive spatial query processing technique for GIS. We present a family of the  ...  The need for interactive spatial queries has arisen in many applications such as Geographic Information Systems (GIS) for efficient decision-support.  ...  The following people provided helpful suggestions during early stages of this work: Dr. Sada Narayanappa, Brandon Haenlein, and Mohammed Albow. Help in statistics was graciously provided by Dr.  ... 
doi:10.1007/s10707-009-0089-0 fatcat:c7edtyxervfill757ls67pd3ay

Efficient cost models for spatial queries using R-trees

Y. Theodoridis, E. Stefanakis, T. Sellis
2000 IEEE Transactions on Knowledge and Data Engineering  
In this paper, we present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-treebased structures.  ...  Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization.  ...  ACKNOWLEDGMENTS This research was partially supported by the EC funded project ªCHOROCHRONOS: A Research Network for Spatiotemporal Database Systemsº under the TMR program.  ... 
doi:10.1109/69.842247 fatcat:psvpzsuozvewzetn3tebumbidm

Cost models for distance joins queries using R-trees

Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos
2006 Data & Knowledge Engineering  
In this paper, we combine techniques that have been used for the analysis of nearest neighbor and spatial join queries, and derive the performance cost (in terms of disk accesses) of K-CPQs using R-trees  ...  Moreover, we present two interesting extensions of the cost model for K-CPQs, one exploiting the buffering management using R-trees and another for a second type of distance join, the socalled buffer queries  ...  The only study of a cost model for predicting the performance of spatial join query using R-trees when a global buffer is present was proposed in [20] .  ... 
doi:10.1016/j.datak.2005.03.004 fatcat:7cbgm532rjbtrm3cwtiyawuqy4

Cost-Based Predictive Spatiotemporal Join

Wook-Shin Han, Jaehwa Kim, Byung Suk Lee, Yufei Tao, R. Rantzau, V. Markl
2009 IEEE Transactions on Knowledge and Data Engineering  
In this paper we present CoPST, the first and foremost algorithm for such a join using two spatio-temporal indexes.  ...  Our extensive experiments validate the cost model and show its accuracy for realistic data sets.  ...  For this purpose we use cost models of each algorithm and choose one based on the cost estimates at join time.  ... 
doi:10.1109/tkde.2008.159 fatcat:lbbdro7rhzcttb6kxrxbdmgkwy

Integration of spatial join algorithms for processing multiple inputs

Nikos Mamoulis, Dimitris Papadias
1999 SIGMOD record  
Lo and Ravishankar [LR94] propose an algorithm, seeded tree join (STJ), that builds an Rtree-like index (seeded tree) for the second set and then joins the two trees using RJ.  ...  In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of  ...  Algorithm optimal_plan(Query Q, int n) /*n = number of inputs*/ For Each connected subgraph Q2 ∈ Q of size 2 Do Q2.cost = CRJ(A, B); /*eq. (7)*/ Q2.size = Size(A, B); /*eq. (8)*/ EndFor /* Q2 */ For i=  ... 
doi:10.1145/304181.304183 fatcat:u2mv7p2rbra57egiysptwg2v6y

Integration of spatial join algorithms for processing multiple inputs

Nikos Mamoulis, Dimitris Papadias
1999 Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD '99  
Lo and Ravishankar [LR94] propose an algorithm, seeded tree join (STJ), that builds an Rtree-like index (seeded tree) for the second set and then joins the two trees using RJ.  ...  In this paper we analyze previous work on spatial joins and propose a novel algorithm, called slot index spatial join (SISJ), that efficiently computes the spatial join between two inputs, only one of  ...  Algorithm optimal_plan(Query Q, int n) /*n = number of inputs*/ For Each connected subgraph Q2 ∈ Q of size 2 Do Q2.cost = CRJ(A, B); /*eq. (7)*/ Q2.size = Size(A, B); /*eq. (8)*/ EndFor /* Q2 */ For i=  ... 
doi:10.1145/304182.304183 dblp:conf/sigmod/MamoulisP99 fatcat:yl7qsbq7pfbxpi3ep7cfhu7jh4

Complex Spatial Query Processing

Nikos Mamoulis, Dimitris Papadias, Dinos Arkoumanis
2004 Geoinformatica  
These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way.  ...  Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models and (ii) rules that reduce the optimization space significantly.  ...  The selectivity of spatial selections has been studied as a prerequisite for the I/O cost estimation of R-tree window queries [15, 28, 31] .  ... 
doi:10.1023/b:gein.0000040830.73424.f0 fatcat:72zosum4unaolijdmwwgcbyhgm

A Performance Evaluation of Spatial Join Processing Strategies [chapter]

Apostolos Papadopoulos, Philippe Rigaux, Michel Scholl
1999 Lecture Notes in Computer Science  
The QEPs assume R ¥ -tree indexed relations and use a common set of spatial joins algorithms, among which one is a novel extension of a strategy based on an on-the-fly index creation prior to the join  ...  A common platform is used on which a set of spatial access methods and join algorithms are available.  ...  Depending on the estimated size of output(s), a merge of both strategies can be used for a large number of joins.  ... 
doi:10.1007/3-540-48482-5_18 fatcat:47t3ihnqcbfb5dx5mm3ejz2nu4

Hardware Acceleration in Commercial Databases [chapter]

Nagender Bandi, Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
2004 Proceedings 2004 VLDB Conference  
In order to improve the performance of spatial query processing, innovative solutions for reducing this computational cost are beginning to emerge.  ...  Recently, it has been proposed that hardware acceleration of an off-the-shelf graphics card can be used to reduce the computational cost of spatial operations.  ...  Ravikanth Kothuri from Oracle for providing us necessary information about Oracle Spatial as well as giving valuable feedback on this work.  ... 
doi:10.1016/b978-012088469-8.50089-9 dblp:conf/vldb/BandiSAA04 fatcat:6sgwl43blrb5doahdmenokbnbq

Processing and optimization of multiway spatial joins using R-trees

Dimitris Papadias, Nikos Mamoulis, Yannis Theodoridis
1999 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '99  
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all object pairs satisfying  ...  Although several techniques have been proposed for pairwise spatial joins, only limited work has focused on multiway spatial join processing.  ...  Part of this work was done while Yannis Theodoridis was with the National Technical University of Athens, supported by the EU project "Chorochronos: A research network for spatiotemporal database systems  ... 
doi:10.1145/303976.303981 dblp:conf/pods/PapadiasMT99 fatcat:idewimk3qvdg7l6q4d2zfpmxqe

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  
We consider a number of factors, including the relative performance of CPU and disk, the quality of the spatial indexes, and the sizes of the input relations.  ...  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.  ...  Acknowledgments We thank Jignesh Patel for clarifications on implementation details of PBSM.  ... 
doi:10.1007/3-540-46439-5_29 fatcat:m7acmsicanahtehh5qdf33nk74

Constraint-Based Processing of Multiway Spatial Joins

D. Papadias, N. Mamoulis, Y. Theodoridis
2001 Algorithmica  
Finally, we evaluate the efficiency of the proposed techniques and the accuracy of the cost models through extensive experimentation with several query and data combinations.  ...  A multiway spatial join combines information found in three or more spatial relations with respect to some spatial predicates.  ...  We thank Sophie Lamacq for her useful comments. Constraint-Based Processing of Multiway Spatial Joins OF27  ... 
doi:10.1007/s00453-001-0005-y fatcat:nq7czqav6vgitbl4ypnvpiunpe

A Cost Model for Spatial Intersection Queries on RI-Trees [chapter]

Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl
2004 Lecture Notes in Computer Science  
The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications.  ...  This paper complements that approach by effective and efficient models to estimate the selectivity and the I/O cost of interval sequence intersection queries in order to guide the cost-based optimizer  ...  Extended I/O Cost Model Next, we present a I/O cost model for interval intersection queries on the spatial variant of the RI-tree.  ... 
doi:10.1007/978-3-540-24571-1_30 fatcat:szrcxxd4vbbcxhdkx5267pu3pi

How good are modern spatial analytics systems?

Varun Pandey, Andreas Kipf, Thomas Neumann, Alfons Kemper
2018 Proceedings of the VLDB Endowment  
In recent years a lot of spatial analytics systems have emerged. Existing work compares either limited features of these systems or the studies are outdated since new systems have emerged.  ...  In this work, we first explore the available modern spatial processing systems and then thoroughly compare them based on features and queries they support, using real-world datasets.  ...  If it detects a hotspot partition for a query, a cost model evaluates the overhead of repartitioning and takes suitable action.  ... 
doi:10.14778/3236187.3236213 fatcat:f7ujehz35ra7xljqdiwwd2hs5q

STREAK: An Efficient Engine for Processing Top-k SPARQL Queries with Spatial Filters [article]

Jyoti Leeka, Srikanta Bedathur, Debajyoti Bera, Sriram Lakshminarasimhan
2017 arXiv   pre-print
Streak introduces various novel features such as a careful identifier encoding strategy for spatial and non-spatial entities, the use of a semantics-aware Quad-tree index that allows for early-termination  ...  and a clever use of adaptive query processing with zero plan-switch cost.  ...  Streak uses a simple cost model to estimate the cost and cardinalities(C(R ′ )) of its customized driven plans: N-Plan and S-Plan.  ... 
arXiv:1710.07411v1 fatcat:2h2nj2i4fjatrgflzzevfvscsm
« Previous Showing results 1 — 15 out of 27,546 results