The priority R-tree : a practically efficient and worst-case optimal R-tree

L. Arge, M. Berg, de, H.J. Haverkort, K. Yi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Proceedings ACM Special Interest Group on Management of Data (SIGMOD 2004, Paris, France, June 13-18, 2004)
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc.
Pages	347-358
ISBN (Print)	1-58113-859-8
Publication status	Published - 2004

Cite this

@inproceedings{0048545c7af94118af7c92d38ddddd93,

title = "The priority R-tree : a practically efficient and worst-case optimal R-tree",

author = "L. Arge and {Berg, de}, M. and H.J. Haverkort and K. Yi",

year = "2004",

language = "English",

isbn = "1-58113-859-8",

pages = "347--358",

booktitle = "Proceedings ACM Special Interest Group on Management of Data (SIGMOD 2004, Paris, France, June 13-18, 2004)",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

}

The priority R-tree : a practically efficient and worst-case optimal R-tree. / Arge, L.; Berg, de, M.; Haverkort, H.J. et al.
Proceedings ACM Special Interest Group on Management of Data (SIGMOD 2004, Paris, France, June 13-18, 2004). New York: Association for Computing Machinery, Inc., 2004. p. 347-358.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The priority R-tree : a practically efficient and worst-case optimal R-tree

AU - Arge, L.

AU - Berg, de, M.

AU - Haverkort, H.J.

AU - Yi, K.

PY - 2004

Y1 - 2004

UR - http://doi.acm.org/10.1145/1007568.1007608

M3 - Conference contribution

SN - 1-58113-859-8

SP - 347

EP - 358

BT - Proceedings ACM Special Interest Group on Management of Data (SIGMOD 2004, Paris, France, June 13-18, 2004)

PB - Association for Computing Machinery, Inc.

CY - New York

ER -