Results 1 - 10
of
5,223
Query-Point Debugging
"... Software Debugging is still one of the most challenging and time consuming aspects of software development. Monitor-ing the software behavior and finding the causes of this be-havior are located at the center of debugging process. Al-though many tools and techniques have been proposed to support dev ..."
Abstract
- Add to MetaCart
developers in this job, none of them could replace or improve the traditional debugging methods. This paper presents Query-Point debugging as a new debugging ap-proach and explains how it can facilitate debugging for de-velopers.
K-Nearest Neighbor Search for Moving Query Point
- In SSTD
, 2001
"... Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research and real-life applications. The problem assumes that the query point is not static, as in k-nearest neighbor problem, but v ..."
Abstract
-
Cited by 153 (0 self)
- Add to MetaCart
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research and real-life applications. The problem assumes that the query point is not static, as in k-nearest neighbor problem
Nearest neighbor queries.
- ACM SIGMOD Record,
, 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract
-
Cited by 592 (1 self)
- Add to MetaCart
Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
- ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real d-dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract
-
Cited by 984 (32 self)
- Add to MetaCart
Consider a set S of n data points in real d-dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any
The R*-tree: an efficient and robust access method for points and rectangles
- INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract
-
Cited by 1262 (74 self)
- Add to MetaCart
and quadratic R-tree and Greene's variant of the R-tree. This superiority of the R*-tree holds for different types of queries and operations, such as map overlay, for both rectangles and multidimensional points in all experiments. From a practical point of view the R*-tree is very attractive because
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
- ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract
-
Cited by 534 (11 self)
- Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Efficient computation of query point visibility in polygons with holes
- In Proc. 21st Annual Symposium on Computational Geometry
, 2005
"... In this paper, we consider the problem of computing the visibility polygon of a query point inside polygons with holes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase. Our algorithm is based on solutions in [12] and [13] proposed for simple po ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
In this paper, we consider the problem of computing the visibility polygon of a query point inside polygons with holes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase. Our algorithm is based on solutions in [12] and [13] proposed for simple
Incremental Rank Updates for Moving Query Points
"... Abstract. The query for retrieving the rank of all neighbors of a moving object at any given time, a continuous rank query, is an important case of continuous nearest neighbor (CNN) queries. An application for ranking queries is given by an ambulance driver who needs to keep track of the closest hos ..."
Abstract
-
Cited by 13 (8 self)
- Add to MetaCart
hospitals at all times. We present a set of incremental algorithms that facilitate efficient rank updates for some or all neighbors of a moving query point. The proposed algorithms allow us not only to maintain the exact rank of all n neighbors at any given time but also to track the rank of a subset of all
Multidimensional Access Methods
, 1998
"... Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that ..."
Abstract
-
Cited by 686 (3 self)
- Add to MetaCart
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects
Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
, 1995
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several ..."
Abstract
-
Cited by 502 (22 self)
- Add to MetaCart
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several
Results 1 - 10
of
5,223