1 / 45

How range queries work

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

aurek
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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The UB-Tree How range queries work • 2000 FORWISS 1

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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

  15. 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

  16. 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

  17. 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

  18. 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

  19. 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

  20. 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

  21. 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

  22. 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

  23. 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

  24. 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

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 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

  31. 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

  32. 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

  33. 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

  34. 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

  35. 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

  36. 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

  37. 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

  38. 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

  39. 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

  40. 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

  41. 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

  42. 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

  43. 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

  44. 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

  45. 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

More Related