Efficient Processing of Spatial Queries in Line Segment Databases

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-54414-3_41
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

Efficient Processing of Large Spatial Queries Using Interior Approximations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

International Journal of Database Management Systems
2014English

Processing Recommender Top-N Queries in Relational Databases

Journal of Software
2015English

On the Efficient Evaluation of Relaxed Queries in Biological Databases

2002English

Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems
Information Systems
2005English

Erratum to “Efficient Processing of Moving Top-K Spatial Keyword Queries in Directed and Dynamic Road Networks”

Wireless Communications and Mobile Computing
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2019English

Towards Real-Time Parallel Processing of Spatial Queries

2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy