HEAL DSpace

Approximate processing of multiway spatial joins in very large databases

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Papadias, D en
dc.contributor.author Arkoumanis, D en
dc.date.accessioned 2014-03-01T01:17:33Z
dc.date.available 2014-03-01T01:17:33Z
dc.date.issued 2002 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/14559
dc.subject Approximate Matching en
dc.subject Approximate Query Processing en
dc.subject Approximate Solution en
dc.subject Exact Solution en
dc.subject Indexation en
dc.subject Query Processing en
dc.subject Search Space en
dc.subject Spatial Join en
dc.subject Very Large Database en
dc.subject Real Time Systems en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.other CONSTRAINT SATISFACTION en
dc.title Approximate processing of multiway spatial joins in very large databases en
heal.type journalArticle en
heal.identifier.primary 10.1007/3-540-45876-X_13 en
heal.identifier.secondary http://dx.doi.org/10.1007/3-540-45876-X_13 en
heal.language English en
heal.publicationDate 2002 en
heal.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. en
heal.publisher SPRINGER-VERLAG BERLIN en
heal.journalName ADVANCES IN DATABASE TECHNOLOGY - EDBT 2002 en
heal.bookName LECTURE NOTES IN COMPUTER SCIENCE en
dc.identifier.doi 10.1007/3-540-45876-X_13 en
dc.identifier.isi ISI:000181347400013 en
dc.identifier.volume 2287 en
dc.identifier.spage 179 en
dc.identifier.epage 196 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record