Article

Efficient Processing of Spatial Queries in Line Segment Databases

Authors:

Erik G. Hoel,

Hanan SametAuthors Info & Claims

SSD '91: Proceedings of the Second International Symposium on Advances in Spatial Databases

Pages 237 - 256

Published: 28 August 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124
Whitman RPark MAmbrose SHoel EHuang YSchneider MGertz MKrumm JSankaranarayanan J(2014)Spatial indexing and analytics on HadoopProceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/2666310.2666387(73-82)Online publication date: 4-Nov-2014
https://dl.acm.org/doi/10.1145/2666310.2666387
Samet H(2010)Multidimensional data structures for spatial applicationsAlgorithms and theory of computation handbook10.5555/1882757.1882763(6-6)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.5555/1882757.1882763
Show More Cited By

Efficient Processing of Spatial Queries in Line Segment Databases
1. Information systems
  1. Data management systems
    1. Database management system engines
  2. Information systems applications
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Efficient Processing of Reverse Top-k Dominating Queries
CSAI '18: Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence

The top-k dominating queries (kDQ) are very useful to the users who hope to select their favorite products. It combines the characteristics of top-k query and skyline query. Although kDQ has been well-studied in the literature, there is, to the best of ...
Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Batch processing of Top-k Spatial-textual Queries
GeoRich'15: Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data

Top-k spatial-textual queries have received significant attention in the research community. Several techniques to efficiently process this class of queries are now widely used in a variety of applications. However, the problem of how best to process ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SSD '91: Proceedings of the Second International Symposium on Advances in Spatial Databases

August 1991

446 pages

ISBN:3540544143

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 August 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khan AKulik LTanin EHua HHashem T(2018)Efficient Computation of the Optimal Accessible Location for a Group of Mobile AgentsACM Transactions on Spatial Algorithms and Systems10.1145/32391244:4(1-32)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3239124
Whitman RPark MAmbrose SHoel EHuang YSchneider MGertz MKrumm JSankaranarayanan J(2014)Spatial indexing and analytics on HadoopProceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/2666310.2666387(73-82)Online publication date: 4-Nov-2014
https://dl.acm.org/doi/10.1145/2666310.2666387
Samet H(2010)Multidimensional data structures for spatial applicationsAlgorithms and theory of computation handbook10.5555/1882757.1882763(6-6)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.5555/1882757.1882763
Hayashi HTanizaki MSato AKimura KKajiyama HIrie MWolfson OAgrawal DLu C(2009)Spatial search processing in embedded devicesProceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/1653771.1653858(516-519)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1145/1653771.1653858
Samet HSankaranarayanan JAlborzi HLakshmanan LNg RShasha D(2008)Scalable network distance browsing in spatial databasesProceedings of the 2008 ACM SIGMOD international conference on Management of data10.1145/1376616.1376623(43-54)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1376616.1376623
Mouratidis KYiu MPapadias DMamoulis N(2006)Continuous nearest neighbor monitoring in road networksProceedings of the 32nd international conference on Very large data bases10.5555/1182635.1164133(43-54)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.5555/1182635.1164133
Raptopoulou KVassilakopoulos MManolopoulos Y(2006)On past-time indexing of moving objectsJournal of Systems and Software10.1016/j.jss.2005.10.02079:8(1079-1091)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1016/j.jss.2005.10.020
Belussi ABertino ECatania B(2002)Using spatial data access structures for filtering nearest neighbor queriesData & Knowledge Engineering10.1016/S0169-023X(01)00033-740:1(1-31)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1016/S0169-023X%2801%2900033-7
An NSivasubramaniam AVijaykrishnan NKandemir MIrwin MGurumurthi S(2001)Analyzing energy behavior of spatial access methods for memory-resident dataProceedings of the 27th International Conference on Very Large Data Bases10.5555/645927.672374(411-420)Online publication date: 11-Sep-2001
https://dl.acm.org/doi/10.5555/645927.672374
Hjaltason GSamet H(1999)Distance browsing in spatial databasesACM Transactions on Database Systems10.1145/320248.32025524:2(265-318)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/320248.320255
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Efficient Processing of Reverse Top-k Dominating Queries

Scalable and efficient processing of top-k multiple-type integrated queries

Batch processing of Top-k Spatial-textual Queries

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations