Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6072
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sharma, Siddharth | - |
dc.contributor.author | Saha, Suman [Guided by] | - |
dc.date.accessioned | 2022-09-09T10:36:39Z | - |
dc.date.available | 2022-09-09T10:36:39Z | - |
dc.date.issued | 2015 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6072 | - |
dc.description.abstract | A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. 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. Such a neighborhood concept can be specified by the user via different functions. It can be an explicit circular region within a given distance from the flat. Another intuitive definition is to assign higher weights to the features based on their proximity to the flat. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Extensive evaluation of our methods on both real and synthetic data reveals that an optimized branch-and-bound solution is efficient and robust with respect to different parameters. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Data mining | en_US |
dc.subject | Ranking spatial data | en_US |
dc.subject | Query evaluation | en_US |
dc.title | Ranking Spatial Data by Quality Preferences | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | B.Tech. Project Reports |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ranking Spatial Data by Quality Preferences.pdf | 1.37 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.