Fixed queries array: A fast and economical data structure for proximity searching
type: Item
instance of: scholarly article
title: Fixed queries array: A fast and economical data structure for proximity searching
zbMATH Open document ID: 1035.68578
DOI: 10.1023/A:1011343115154
author: Edgar Chávez
author: José L. Marroquin
author: Gonzalo Navarro
published in: Multimedia Tools and Applications
publication date: 2003-02-17T00:00:00Z
Mathematics Subject Classification ID: 68U99
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1870036
zbMATH Keywords: metric spaces
zbMATH Keywords: similarity search
zbMATH Keywords: range search
zbMATH Keywords: fixed queries tree
MaRDI profile type: Publication
full work available at URL: a:1011343115154
OpenAlex ID: W1592473003
Recommended article: Dynamic data structures for \(k\)-nearest neighbor queries
Recommended article: Q3140429
Recommended article: A dynamic data structure for approximate range searching
Recommended article: A Unified Approach to Approximate Proximity Searching
Recommended article: Sequential and MapReduce-based algorithms for constructing an in-place multidimensional quad-tree index for answering fixed-radius nearest neighbor queries
Recommended article: Q2766837
Recommended article: Efficient computation of a proximity matching in spatial databases
description: scientific article; zbMATH DE number 1870036