The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
SIGMOD, 2004.

SIGMOD 2004
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SIGMOD-2004-ArgeBHY,
	author        = "Lars Arge and Mark de Berg and Herman J. Haverkort and Ke Yi",
	booktitle     = "{Proceedings of the 32nd ACM SIGMOD International Conference on Management of Data}",
	doi           = "10.1145/1007568.1007608",
	isbn          = "1-58113-859-8",
	pages         = "347--358",
	publisher     = "{ACM}",
	title         = "{The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree}",
	year          = 2004,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.