S*-Tree: An Improved S⁺-Tree for Coloured Images.

@inproceedings{DBLP:conf/adbis/NardelliP99,
  author    = {Enrico Nardelli and
               Guido Proietti},
  editor    = {Johann Eder and
               Ivan Rozman and
               Tatjana Welzer},
  title     = {S*-Tree: An Improved S$^{\mbox{+}}$-Tree for Coloured Images},
  booktitle = {Advances in Databases and Information Systems, Third East European
               Conference, ADBIS'99, Maribor, Slovenia, September 13-16, 1999,
               Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1691},
  year      = {1999},
  isbn      = {3-540-66485-8},
  pages     = {156-167},
  ee        = {db/conf/adbis/NardelliP99.html, http://link.springer.de/link/service/series/0558/bibs/1691/16910156.htm},
  crossref  = {DBLP:conf/adbis/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An5-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: Springer LINK

References

[1]

...

[2]

Walid G. Aref, Hanan Samet: Efficient Processing of Window Queries in The Pyramid Data Structure. PODS 1990: 265-272 BibTeX

[3]

...

[4]

Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos: Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles. IEEE Trans. Knowl. Data Eng. 9(3): 373-383(1997) BibTeX

[5]

Irene Gargantini: An Effective Way to Represent Quadtrees. Commun. ACM 25(12): 905-910(1982) BibTeX

[6]

...

[7]

Enrico Nardelli, Guido Proietti: Time and Space Efficient Secondary Memory Representation of Quadtrees. Inf. Syst. 22(1): 25-37(1997) BibTeX

[8]

Guido Proietti: An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks. Acta Inf. 36(4): 257-266(1999) BibTeX

[9]

Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16(2): 187-260(1984) BibTeX

[10]

...

[11]

Clifford A. Shaffer, Patrick R. Brown: A Paging Scheme for Pointer-Based Quadtrees. SSD 1993: 89-104 BibTeX

[12]

...

[13]

...

[14]

...