ComputingComputer ScienceGeoinformaticsDatabasesInformation RetrievalSpatial AnalysisGeographic Information RetrievalNearest Neighbor SearchQuery OptimizationQuery ProcessingSearching AlgorithmsWeb SearchExact AlgorithmsGraph DiameterNearest Neighbor Data StructuresNearest Neighbor QueriesNearest Neighbor RetrievalProximity QueriesProximity SearchSpatial Query Processing
As an important type of spatial keyword query, the m-closest keywords (mCK) query finds a group of objects such that they cover all query keywords and have the smallest diameter, which is defined as the largest distance between any pair of objects in the group. The query is useful in many applications such as detecting locations of web resources. However, the existing work does not study the intractability of this problem and only provides exact algorithms, which are computationally expensive.
25
Distance browsing in spatial databases
Gı́sli R. Hjaltason, Hanan Samet · ACM Transactions on Database Systems · 1999 · 877 citations · Full text
Keyword Search on Spatial Databases
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe · 2008 · 485 citations