2019
DOI: 10.1007/978-3-030-27629-4_7
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…To introduce skyline queries based on the orthogonal query range (i.e., ORSQ), we firstly introduce the orthogonal range [11]. Queries based on the orthogonal range are retrieved within the range R, where R = R 1 ∩ .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To introduce skyline queries based on the orthogonal query range (i.e., ORSQ), we firstly introduce the orthogonal range [11]. Queries based on the orthogonal range are retrieved within the range R, where R = R 1 ∩ .…”
Section: Introductionmentioning
confidence: 99%
“…An example of the MRN Algorithm.Complexity analysis: The complexity of MRN is mainly consists of sorting skylineW in step 6 (i.e., O(N * log 2 N)), finding the position of the abscissa of w in ox in step 7 (i.e., O(log 2 N)) and traversing SP(R) part in steps[8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. Suppose there are n elements in SP(R) and k elements in SP(R) part .…”
mentioning
confidence: 99%