Scribd
Upload
86 views3 pages

Calculating The Longest Dominated Locations: Abstract

This document proposes a novel query called the furthest dominated location (FDL) query that combines both spatial locations and quality attributes. Existing spatial queries ignore quality attributes and dominance-based queries neglect spatial locations. The paper develops efficient R-tree based algorithms to process FDL queries, which are not solved by existing techniques. It adapts an incremental nearest neighbor search algorithm to find FDLs without much additional investment. The paper conducts theoretical analysis and experiments showing the proposed methods are efficient and scalable for spatial decision support applications.

Uploaded by

naveen_thumu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
86 views3 pages

Calculating The Longest Dominated Locations: Abstract

This document proposes a novel query called the furthest dominated location (FDL) query that combines both spatial locations and quality attributes. Existing spatial queries ignore quality attributes and dominance-based queries neglect spatial locations. The paper develops efficient R-tree based algorithms to process FDL queries, which are not solved by existing techniques. It adapts an incremental nearest neighbor search algorithm to find FDLs without much additional investment. The paper conducts theoretical analysis and experiments showing the proposed methods are efficient and scalable for spatial decision support applications.

Uploaded by

naveen_thumu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

CALCULATING THE LONGEST DOMINATED LOCATIONS

Abstract:
In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). Traditional spatial queries (e.g., nearest neighbor, closest pair) ignore quality attributes, whereas conventional dominance-based queries (e.g., skyline) neglect spatial locations. Motivated by these observations, we propose a novel query by combining spatial and quality attributes together meaningfully. FDL queries are suitable for various spatial decision support applications such as business planning, wild animal protection, and digital battle field systems. As FDL queries are not solved by existing techniques, we develop several efficient R-tree based algorithms for processing FDL queries.

datasets only. We combine both spatial locations and quality attributes to define a skyline query that not retrieves practically meaningful locations as expected.

Disadvantages: The system introduced the spatial queries. The queries were not implanted the NN search algorithm for collecting the spatial
location of spatial objects.

Whichs not sufficient to know the ND(Nearest Dominators).

Proposed System:
This paper is the first to formulate the FDL query that captures practical needs involving not only spatial locations but also quality attributes. Second, we adapt the incremental NN search algorithm to process the FDL query. This makes it possible to find the FDL on legacy implementations without much additional investment. Third, we design specific and more efficient methods for the FDL query. Fourth, we conduct a thorough theoretic analysis on the performance of proposed methods. Fifth, we generalize our proposals to deal with the generic distance metric and other interesting query types. Finally, we conduct an extensive experimental study for the proposed methods on both real and synthetic datasets, and show that our best algorithm is indeed efficient and scalable.

Advantages: We are using the traditional technique of data mining such as Nearest Neighbors (NN)
and Closest Pair for various spatial decisions from the application.

The FDL queries are dominated the spatial objects with their attributes to get the spatial
distances and also locations but this is not in an existing application.

The skyline queries problems are solved by the FDL queries and R-tree algorithm Hardware Requirements

SYSTEM HARD DISK FLOPPY DRIVE MONITOR MOUSE RAM

: Pentium IV 2.4 GHz : 40 GB : 1.44 MB : 15 VGA colour : Logitech. : 256 MB

KEYBOARD : 110 keys enhanced.

Software Requirements:
Operating system Front End Coding Language Database :- Windows 7/ XP Professional :- Microsoft Visual Studio .Net 2008 :- C# :- SQL SERVER 2005

You might also like