✦ LIBER ✦

Range queries over skip tree graphs

✍ Scribed by A. González-Beltrán; P. Milligan; P. Sage

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average Complexity of Addition Updates a

✍ A. Toni 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Efficient range query processing over DH

✍ Yiming Zhang; Ling Liu; Xicheng Lu; Dongsheng Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB

Searching Steiner trees for web graph qu

✍ Wookey Lee; Woong-Kee Loh; Mye M. Sohn 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Forward node-selecting queries over tree

✍ Olteanu, Dan 📂 Article 📅 2007 🏛 Association for Computing Machinery 🌐 English ⚖ 499 KB

On Cartesian Trees and Range Minimum Que

✍ Erik D. Demaine, Gad M. Landau, Oren Weimann 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 562 KB

Selectivity estimators for multidimensio

✍ Dimitrios Gunopulos; George Kollios; Vassilis J. Tsotras; Carlotta Domeniconi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 314 KB