File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Inverse queries for multidimensional spaces

TitleInverse queries for multidimensional spaces
Authors
KeywordsDatabase objects
K-nearest-neighbor queries
Multi-dimensional space
Pruning strategy
Query predicates
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 12th International Symposium on Spatial and Temporal Databases (SSTD 2011), Minneapolis, MN., 24-26 August 2011. In Lecture Notes in Computer Science, 2011, v. 6849, p. 330-347 How to Cite?
AbstractTraditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches. © 2011 Springer-Verlag.
DescriptionThis vol. of LNCS has title: Advances in spatial and temporal databases: 12th international symposium, SSTD 2011, Minneapolis, MN, USA, August 24 - 26, 2011 : proceedings
Persistent Identifierhttp://hdl.handle.net/10722/137650
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorBernecker, Ten_HK
dc.contributor.authorEmrich, Ten_HK
dc.contributor.authorKriegel, HPen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorRenz, Men_HK
dc.contributor.authorZhang, Sen_HK
dc.contributor.authorZüfle, Aen_HK
dc.date.accessioned2011-08-26T14:30:32Z-
dc.date.available2011-08-26T14:30:32Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 12th International Symposium on Spatial and Temporal Databases (SSTD 2011), Minneapolis, MN., 24-26 August 2011. In Lecture Notes in Computer Science, 2011, v. 6849, p. 330-347en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/137650-
dc.descriptionThis vol. of LNCS has title: Advances in spatial and temporal databases: 12th international symposium, SSTD 2011, Minneapolis, MN, USA, August 24 - 26, 2011 : proceedings-
dc.description.abstractTraditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches. © 2011 Springer-Verlag.en_HK
dc.languageengen_US
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.rightsThe original publication is available at www.springerlink.com-
dc.subjectDatabase objects-
dc.subjectK-nearest-neighbor queries-
dc.subjectMulti-dimensional space-
dc.subjectPruning strategy-
dc.subjectQuery predicates-
dc.titleInverse queries for multidimensional spacesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-22922-0_20en_HK
dc.identifier.scopuseid_2-s2.0-80052707782en_HK
dc.identifier.hkuros190942en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052707782&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6849 LNCSen_HK
dc.identifier.spage330en_HK
dc.identifier.epage347en_HK
dc.publisher.placeGermanyen_HK
dc.description.otherThe 12th International Symposium on Spatial and Temporal Databases (SSTD 2011), Minneapolis, MN., 24-26 August 2011. In Lecture Notes in Computer Science, 2011, v. 6849, p. 330-347-
dc.identifier.scopusauthoridBernecker, T=24512341500en_HK
dc.identifier.scopusauthoridEmrich, T=35104699500en_HK
dc.identifier.scopusauthoridKriegel, HP=7005718994en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridRenz, M=22433777600en_HK
dc.identifier.scopusauthoridZhang, S=50263641800en_HK
dc.identifier.scopusauthoridZüfle, A=26666444500en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats