Evaluating Top-K Selection Queries Over Web-Spatial Database
A spatial preference query ranks objects based on the scores of feature object in their spatial neighborhood. Along with the location based applications existing algorithm includes non negligible processing cost which results a high response time, because computing the score of data object needs examining its spatial neighborhood to find feature object with highest score. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. The shortest-path problem is an essential component of many applications including Advanced Traveler Information Systems (ATIS), computer networks, etc.