Amanote Research

Amanote Research

  • Register
  • Sign In

Efficient Processing of Large Spatial Queries Using Interior Approximations

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-47724-1_21

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2001

Authors

Ravi K. KothuriSiva Ravada

Publisher

Springer Berlin Heidelberg


Related search

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Processing of Spatial Queries in Line Segment Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

International Journal of Database Management Systems
2014English

Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems
Information Systems
2005Spanish

Towards Real-Time Parallel Processing of Spatial Queries

2003English

Processing and Optimizing Main Memory Spatial-Keyword Queries

Proceedings of the VLDB Endowment
Computer Science
2015English

Processing Fuzzy Spatial Queries: A Configuration Similarity Approach

International Journal of Geographical Information Science
DevelopmentInformation SystemsInformation SciencesLibraryPlanningGeography
1999English

Efficient Processing of Category-Restricted Queries for Web Directories

English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy