Space efficient data structures for nearest larger neighbor

被引：4

作者：

Jayapaul, Varunkumar ^{[1
]}

Jo, Seungbum ^{[2
]}

Raman, Rajeev ^{[3
]}

Raman, Venkatesh ^{[4
]}

Satti, Srinivasa Rao ^{[2
]}

机构：

[1] Chennai Math Inst, Madras, Tamil Nadu, India

[2] Seoul Natl Univ, Seoul 151, South Korea

[3] Univ Leicester, Leicester LE1 7RH, Leics, England

[4] Inst Math Sci, Madras, Tamil Nadu, India

来源：

JOURNAL OF DISCRETE ALGORITHMS | 2016年 / 36卷

关键词：

Nearest larger neighbor; Succinct data structures; Indexing model; Encoding model; Cartesian tree; Range minimum query;

D O I：

10.1016/j.jda.2016.01.001

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a sequence of n elements from a totally ordered set, and a position in the sequence, the nearest larger neighbor (NLN) query returns the position of the element which is closest to the query position, and is larger than the element at the query position. The problem of finding the nearest larger neighbors of all the elements in a one-dimensional array has attracted interest due to its applications for parenthesis matching and in computational geometry [1-3]. We consider a data structure version of this problem, which is to preprocess a given sequence of elements to construct a data structure that can answer NLN queries efficiently. We consider time-space tradeoffs for the problem in both the indexing and the encoding models when the input is in a one dimensional array, and also initiate the study of this problem on two-dimensional arrays. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：63 / 75

页数：13

共 50 条

[41] Strategies for efficient incremental nearest neighbor search
Broder, Alan J.
Pattern Recognition, 1990, 23 (1-2): : 171 - 178
[42] STRATEGIES FOR EFFICIENT INCREMENTAL NEAREST NEIGHBOR SEARCH
BRODER, AJ
PATTERN RECOGNITION, 1990, 23 (1-2) : 171 - 178
[43] Efficient Surf Tracking by Nearest Neighbor Classifier
Tong, Minglei
Chen, Shudong
JOURNAL OF COMPUTERS, 2014, 9 (10) : 2449 - 2454
[44] Efficient nearest neighbor searching for motion planning
Atramentov, A
LaValle, SM
2002 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, 2002, : 632 - 637
[45] Efficient Classification with an Improved Nearest Neighbor Algorithm
Pujari, Madhavi
Awati, Chetan
Kharade, Sonam
2018 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION CONTROL AND AUTOMATION (ICCUBEA), 2018,
[46] What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search?
Iwamura, Masakazu
Sato, Tomokazu
Kise, Koichi
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 3535 - 3542
[47] A model for k-nearest neighbor query processing cost in multidimensional data space
Lee, JH
Cha, GH
Chung, CW
INFORMATION PROCESSING LETTERS, 1999, 69 (02) : 69 - 76
[48] mmLSH: A Practical and Efficient Technique for Processing Approximate Nearest Neighbor Queries on Multimedia Data
Jafari, Omid
Nagarkar, Parth
Montano, Jonathan
SIMILARITY SEARCH AND APPLICATIONS, SISAP 2020, 2020, 12440 : 47 - 61
[49] MAGNETIC-STRUCTURES OF FCC SYSTEMS WITH NEAREST-NEIGHBOR AND NEXT-NEAREST-NEIGHBOR EXCHANGE INTERACTIONS
SEEHRA, MS
GIEBULTOWICZ, TM
PHYSICAL REVIEW B, 1988, 38 (16) : 11898 - 11900
[50] Grid-R-tree: a data structure for efficient neighborhood and nearest neighbor queries in data mining
Poonam Goyal
Jagat Sesh Challa
Dhruv Kumar
Anuvind Bhat
Sundar Balasubramaniam
Navneet Goyal
International Journal of Data Science and Analytics, 2020, 10 : 25 - 47

← 1 2 3 4 5 →