how range queries work
Download
Skip this Video
Download Presentation
How range queries work

Loading in 2 Seconds...

play fullscreen
1 / 45

How range queries work - PowerPoint PPT Presentation


  • 95 Views
  • Uploaded on

The UB-Tree. How range queries work. 2000 FORWISS. 1. Code. UB-Tree. rangeQuery(Tuple ql , Tuple qh ) { Zaddress s tart = Z( ql ); Zaddress cur = s tart ; Zaddress en d = Z( qh ); Page page = {}; w hile (1) { cur = getRegionSeparator( cur );

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'How range queries work' - aurek


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
how range queries work
The UB-Tree

How range queries work

  • 2000 FORWISS

1

slide2
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide3
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide4
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide5
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide6
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide7
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide8
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide9
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide10
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide11
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide12
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide13
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide14
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide15
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide16
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide17
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide18
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide19
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide20
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide21
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide22
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide23
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide24
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide25
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide26
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide27
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide28
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide29
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide30
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide31
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide32
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide33
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide34
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide35
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide36
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide37
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide38
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide39
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide40
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide41
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide42
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide43
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide44
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

slide45
Code

UB-Tree

rangeQuery(Tuple ql, Tuple qh)

{

Zaddress start= Z(ql);

Zaddress cur= start;

Zaddress end= Z(qh);

Page page = {};

while (1)

{

cur= getRegionSeparator(cur);

page = getPage(cur);

outputMatchingTuples(page, ql, qh);

if (cur >= end) break;

cur= getNextZaddress(cur, start, end);

}

}

B-Tree

Zaddress

ad