NDLI: Data redundancy and duplicate detection in spatial join processing

Content Provider	IEEE Xplore Digital Library
Author	Dittrich, J.-P. Seeger, B.
Copyright Year	2000
Description	Author affiliation: Dept. of Math. & Comput. Sci., Marburg Univ., Germany (Dittrich, J.-P.)
Abstract	The partition-based spatial-merge join (PBSM) of J.M. Patel and D.J. DeWitt (1996) and the size separation spatial join (S/sup 3/J) of N. Koudas and K.C. Sevcik (1997) are considered to be among the most efficient methods for processing spatial (intersection) joins on two or more spatial relations. Neither method assumes the presence of pre-existing spatial indices on the relations. In this paper, we propose several improvements to these join algorithms. In particular, we deal with the impact of data redundancy and duplicate detection on the performance of these methods. For PBSM, we present a simple and inexpensive online method to detect duplicates in the response set. There is no longer any need to eliminate duplicates in a final sorting phase, as was originally suggested. We also investigate the impact of different internal algorithms on the total run-time of PBSM. For S/sup 3/J, we break with the original design goal and introduce controlled redundancy of data objects. Results of a large set of experiments with real data sets reveal that our suggested modifications to PBSM and S/sup 3/J result in substantial performance improvements, where PBSM is generally superior to S/sup 3/J.
Starting Page	535
Ending Page	546
File Size	81580
Page Count	12
File Format	PDF
ISBN	0769505066
ISSN	10636382
DOI	10.1109/ICDE.2000.839452
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-03-03
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Costs Sorting Runtime Availability Filters Lead Partitioning algorithms Mathematics Computer science Multidimensional systems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Data redundancy and duplicate detection in spatial join processing (2000)

Optimizing join index based join processing: a graph partitioning approach

Spatial join processing using corner transformation

A graph-based multilevel partitioning scheme for reducing disk access cost of spatial join processing

Efficient evaluation of the valid-time natural join

k-Balanced sorting and skew join in MPI and MapReduce

A truncating hash algorithm for processing band-join queries

Scalable Iterative Graph Duplicate Detection

Parallel domain decomposition and load balancing using space-filling curves

Data redundancy and duplicate detection in spatial join processing

Similar Documents

Data redundancy and duplicate detection in spatial join processing (2000)

Optimizing join index based join processing: a graph partitioning approach

Spatial join processing using corner transformation

A graph-based multilevel partitioning scheme for reducing disk access cost of spatial join processing

Efficient evaluation of the valid-time natural join

k-Balanced sorting and skew join in MPI and MapReduce

A truncating hash algorithm for processing band-join queries

Scalable Iterative Graph Duplicate Detection

Parallel domain decomposition and load balancing using space-filling curves

Data redundancy and duplicate detection in spatial join processing