File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Evaluation of iceberg distance joins

TitleEvaluation of iceberg distance joins
Authors
Issue Date2003
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2003, v. 2750, p. 270-288 How to Cite?
Abstract
The iceberg distance join returns object pairs within some distance from each other, provided that the first object appears at least a number of times in the result, e.g., "find hotels which are within 1km to at least 10 restaurants". The output of this query is the subset of the corresponding distance join (e.g., "find hotels which are within 1km to some restaurant") that satisfies the additional cardinality constraint. Therefore, it could be processed by using a conventional spatial join algorithm and then filtering-out the non-qualifying pairs. This approach, however, is expensive, especially when the cardinality constraint is highly selective. In this paper, we propose output-sensitive algorithms that prune the search space by integrating the cardinality with the distance constraint. We deal with cases of indexed/non-indexed datasets and evaluate the performance of the proposed techniques with extensive experimental evaluation covering a wide range of problem parameters. © Springer-Verlag Berlin Heidelberg 2003.
Persistent Identifierhttp://hdl.handle.net/10722/93234
ISSN
2013 SCImago Journal Rankings: 0.310
References

 

Author Affiliations
  1. The University of Hong Kong
  2. Hong Kong University of Science and Technology
DC FieldValueLanguage
dc.contributor.authorShou, Yen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorCao, Hen_HK
dc.contributor.authorPapadias, Den_HK
dc.contributor.authorCheung, DWen_HK
dc.date.accessioned2010-09-25T14:54:57Z-
dc.date.available2010-09-25T14:54:57Z-
dc.date.issued2003en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2003, v. 2750, p. 270-288en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93234-
dc.description.abstractThe iceberg distance join returns object pairs within some distance from each other, provided that the first object appears at least a number of times in the result, e.g., "find hotels which are within 1km to at least 10 restaurants". The output of this query is the subset of the corresponding distance join (e.g., "find hotels which are within 1km to some restaurant") that satisfies the additional cardinality constraint. Therefore, it could be processed by using a conventional spatial join algorithm and then filtering-out the non-qualifying pairs. This approach, however, is expensive, especially when the cardinality constraint is highly selective. In this paper, we propose output-sensitive algorithms that prune the search space by integrating the cardinality with the distance constraint. We deal with cases of indexed/non-indexed datasets and evaluate the performance of the proposed techniques with extensive experimental evaluation covering a wide range of problem parameters. © Springer-Verlag Berlin Heidelberg 2003.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.titleEvaluation of iceberg distance joinsen_HK
dc.typeArticleen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.emailCheung, DW:dcheung@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.identifier.authorityCheung, DW=rp00101en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-35248901991en_HK
dc.identifier.hkuros81296en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35248901991&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2750en_HK
dc.identifier.spage270en_HK
dc.identifier.epage288en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridShou, Y=8277999000en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridCao, H=7403346030en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.scopusauthoridCheung, DW=34567902600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats