How range queries work
This presentation is the property of its rightful owner.
Sponsored Links
1 / 45

How range queries work PowerPoint PPT Presentation


  • 62 Views
  • Uploaded on
  • Presentation posted in: General

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 );

Download Presentation

How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


How range queries work

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


  • Login