Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"k Nearest-Neighbor Query"”.

  1. Advanced similarity queries and their application in data mining

    … Two variants of similarity queries - the k-nearest Neighbor join (kNN join) and the Reverse k-Nearest Neighbor query (RkNN query) have been closely investigated. Efficient algorithms have been proposed. Gorder is a block nested loop join method utilizing sorting, data blocks scheduling and …

    nus Repository record for Advanced similarity queries and their application in data mining (opens in a new tab) Download file for Advanced similarity queries and their application in data mining (opens in a new tab)

  2. CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries.

    A k nearest neighbor query q retrieves k objects that lie closest to the query point q among a given set of objects P. With the availability of inexpensive location aware mobile devices, the continuous monitoring of such queries has gained lot of attention and many methods have been proposed for …

    unsw Repository record for CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries. (opens in a new tab)

  3. Algorithms for processing closest-pairs and nearest-neighbors queries on big spatial data in parallel and distributed frameworks

    … processing of computationally demanding spatial query operations. The following demanding queries are applied on two datasets and combine join queries (since all possible combinations formed from these datasets are candidates for the final result) and nearest-neighbor queries (since the final …

    greece Repository record for Algorithms for processing closest-pairs and nearest-neighbors queries on big spatial data in parallel and distributed frameworks (opens in a new tab)

  4. Neue Indexingverfahren für die Ähnlichkeitssuche in metrischen Räumen über großen Datenmengen

    Ein zunehmend wichtiges Thema in der Informatik ist der Umgang mit Ähnlichkeit in einer großen Anzahl unterschiedlicher Domänen. Derzeit existiert keine universell verwendbare Infrastruktur für die Ähnlichkeitssuche in allgemeinen metrischen Räumen. Ziel der Arbeit ist es, die Grundlage für eine …

    qucosa-diss

  5. Parallel query processing on big spatial data

    … are point-location, window, distance-range and k nearest-neighbor queries (k-NNQs). At a higher level, such queries have been used as the basis of many complex operations in advanced applications, for example, geographical information systems (GIS), location-based systems (LBS), geometric …

    greece Repository record for Parallel query processing on big spatial data (opens in a new tab)