Proceedings Article10.1109/SSDBM.2006.41
Progressive Spatial Join
Wee Hyong Tok,Stéphane Bressan,Mong Li Lee +2 more
- 03 Jul 2006
- pp 353-358
12
TL;DR: The ongoing work on designing progressive spatial join algorithm as an initial step is presented, which aims to design a generic framework for adaptive and progressive spatial query processing.
read more
Abstract: In spatial data exploration and analysis, the system would present a user with initial promising results and empower the user to modify runtime query parameters. The high degree of interactivity would significantly reduce users waiting time for results that are not useful, and then having to re-issue a new query. To support this level of interaction during query processing, it necessitates the study of adaptive and progressive spatial query processing techniques that can deliver initial results quickly and adapt to run-time fluctuations during the delivery of remote data. Our goal is to design a generic framework for adaptive and progressive spatial query processing. In this paper, we present our ongoing work on designing progressive spatial join algorithm as an initial step.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Progressive, Holistic Geospatial Interlinking
George Papadakis,Georgios M. Mandilaras,Nikos Mamoulis,Manolis Koubarakis +3 more
- 19 Apr 2021
TL;DR: In this paper, the authors introduce a batch algorithm that simultaneously computes all topological relations and defines the task of Progressive Geospatial Interlinking, which produces results in a pay-as-you-go manner when the available computational or temporal resources are limited.
18
Progressive spatial join for polygon data stream
Oje Kwon,Ki-Joune Li +1 more
- 01 Nov 2011
TL;DR: The key idea of the method is to represent a polygon with multiple levels of detail (LODs) and process spatial join in progressive way from low to high LOD, which improves the storage utilization by filtering out non-overlapping polygons with low Lod, but also reduces the processing cost by simpler polygons of low LOD.
14
RRPJ: result-rate based progressive relational join
Wee Hyong Tok,Stéphane Bressan,Mong Li Lee +2 more
- 09 Apr 2007
TL;DR: This paper discusses the limitations of RPJ and proposes a novel extension, called Result Rate-based Progressive Join (RRPJ), which addresses these limitations and simplifies the generalization of the algorithm to non-relational data such as multidimensional data and hierarchical data.
10
Progressive and Approximate Join Algorithms on Data Streams
Wee Hyong Tok,Stéphane Bressan +1 more
- 01 Jan 2013
TL;DR: A framework for progressive join processing, called the Result Rate based Progressive Join (RRPJ) framework, is introduced which can be used for join processing for various data models, and its various instantiations for processing relational, high-dimensional, spatial and XML data.
6
•Posted Content
Speedy Browsing and Sampling with NeedleTail.
TL;DR: A fast sampling engine aimed at letting analysts browse a small sample of the query results on large datasets as quickly as possible, independent of the overall size of the result set, and returns results an order of magnitude faster while occupying up to 30x less memory than existing sampling techniques.
5
References
Interactive data analysis: the Control project
Joseph M. Hellerstein,Ron Avnur,Andy Chou,Christian Hidber,Christopher Olston,Vijayshankar Raman,T. Roth,Peter J. Haas +7 more
TL;DR: The authors are working with collaborators at IBM, Informix, and elsewhere to explore ways to improve human-computer interaction during data analysis to develop interactive, intuitive techniques for analyzing massive data sets.
Spatial joins using seeded trees
Ming-Ling Lo,Chinya V. Ravishankar +1 more
- 24 May 1994
TL;DR: This paper develops a technique that uses intermediate linked lists during tree construction and significantly speeds up the tree construction process and the CPU penalties incurred are also lower except when seed-level filtering is used.
Hash-merge join: a non-blocking join algorithm for producing fast and early join results
Mohamed F. Mokbel,M. Lu,Walid G. Aref +2 more
- 30 Mar 2004
TL;DR: Experimental results show that HMJ combines the advantages of two state-of-the-art nonblocking join algorithms (XJoin and Progressive Merge Join) while avoiding their shortcomings.
140
Data redundancy and duplicate detection in spatial join processing
Jens Dittrich,Bernhard Seeger +1 more
- 01 Feb 2000
TL;DR: This paper proposes several improvements to PBSM and S/sup 3/J, and presents a simple and inexpensive online method to detect duplicates in the response set and introduces controlled redundancy of data objects.
120
Progressive merge join: a generic and non-blocking sort-based join algorithm
Jens-Peter Dittrich,Bernhard Seeger,David Scot Taylor,Peter Widmayer +3 more
- 20 Aug 2002
TL;DR: Progressive Merge Join (PMJ) as mentioned in this paper is a join technique that eliminates the blocking behavior of sort-based join algorithms by having the join produce results as early as the external mergesort generates initial runs, thus it is possible for PMJ to return first results very early.
111