HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Approximate processing of multiway spatial joins in very large databases
Authors: Papadias, Dimitris
Arkoumanis, Dinos
Keywords: Multiway spatial joins processing
Very large databases
Time threshold
Fast retrieval
Approximate matches
Multimedia databases
Issue Date: Mar-2002
Citation: 8th International conference on extended database technology, 2002. (LNCS 2287) p. 179-196
Abstract: Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however, exhaustive processing of multiway spatial joins can be prohibitively expensive due to the exponential nature of the problem. Furthermore, if there do not exist any exact solutions, the result will be empty even though there may exist solutions that match the query very closely. These shortcomings motivate the current work, which aims at the retrieval of the best possible (exact or approximate) solutions within a time threshold, since fast retrieval of approximate matches is the only way to deal with the ever increasing amounts of multimedia information in several real time systems. We propose various techniques that combine local and evolutionary search with underlying indexes to prune the search space. In addition to their usefulness as standalone methods for approximate query processing, the techniques can be combined with systematic search to enhance performance when the goal is retrieval of the best solutions.
Rights: The original publication is available at Please use the appropriate URL and/or DOI for the article.
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
appro.pdfpre-published version305KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.