mirror of https://github.com/CGAL/cgal
109 lines
4.5 KiB
BibTeX
109 lines
4.5 KiB
BibTeX
|
|
@InProceedings{Hellerstein,
|
|
author = "J. M. Hellerstein and J. F. Naughton and A. Pfeffer",
|
|
title = "Generalized Search Trees for Database Systems",
|
|
editor = "Umeshwar Dayal and Peter M. D. Gray and Shojiro
|
|
Nishio",
|
|
booktitle = "{VLDB} '95: proceedings of the 21st International
|
|
Conference on Very Large Data Bases, Zurich,
|
|
Switzerland, Sept. 11--15, 1995",
|
|
publisher = "Morgan Kaufmann Publishers",
|
|
address = "Los Altos, CA 94022, USA",
|
|
year = "1995",
|
|
ISBN = "1-55860-379-4",
|
|
pages = "562--573",
|
|
year = "1995",
|
|
bibdate = "Tue Oct 21 15:14:31 MDT 1997",
|
|
acknowledgement = ack-nhfb,
|
|
annote = "Also known as VLDB 95",
|
|
keywords = "VLDB; very large data bases; large data bases",
|
|
}
|
|
|
|
@InProceedings{LSW97,
|
|
author = " J. van den Bercken and B. Seeger and P. Widmayer",
|
|
title = " {A} {G}eneric {A}pproach to {B}ulk {L}oading
|
|
{M}ultidimensional {I}ndex {S}tructures",
|
|
booktitle = "Proceedings of the 1997 VLDB, Athen",
|
|
year = "1997",
|
|
pages= " ",
|
|
}
|
|
|
|
@InProceedings{gutt-84,
|
|
key = "Guttman",
|
|
author = "A. Guttman",
|
|
title = "{R}-Trees: {A} Dynamic Index Structure For Spatial
|
|
Searching",
|
|
booktitle = "sigmod",
|
|
organization = "acm",
|
|
editor = "B. Yormack",
|
|
address = "Boston, MA",
|
|
month = jun,
|
|
year = "1984",
|
|
pages = "47--57",
|
|
}
|
|
|
|
@Article{Come-79,
|
|
title = "The Ubiquitous {B}-Tree",
|
|
author = "D. Comer",
|
|
journal = "ACM Computing Surveys",
|
|
pages = "121--137",
|
|
month = jun,
|
|
year = "1979",
|
|
volume = "11",
|
|
number = "2",
|
|
}
|
|
|
|
@Article{Beckmann:1990:RER,
|
|
author = "Norbert Beckmann and Hans-Peter Kriegel and Ralf
|
|
Schneider and Bernhard Seeger",
|
|
title = "{R}-tree. An efficient and robust access method for
|
|
points and rectangles",
|
|
journal = "SIGMOD Record (ACM Special Interest Group on
|
|
Management of Data)",
|
|
volume = "19",
|
|
number = "2",
|
|
pages = "322--331",
|
|
month = jun,
|
|
year = "1990",
|
|
coden = "SRECD8",
|
|
ISSN = "0163-5808",
|
|
bibdate = "Mon Dec 9 07:58:51 MST 1996",
|
|
abstract = "The R-tree, one of the most popular access methods for
|
|
rectangles, is based on the heuristic optimization of
|
|
the area of the enclosing rectangle in each inner node.
|
|
By running numerous experiments in a standardized
|
|
testbed under highly varying data, queries and
|
|
operations, we were able to design the R-tree which
|
|
incorporates a combined optimization of area, margin
|
|
and overlap of each enclosing rectangle in the
|
|
directory. Using our standardized testbed in an
|
|
exhaustive performance comparison, it turned out that
|
|
the R-tree clearly outperforms the existing R-tree
|
|
variants: Guttman's linear and quadratic R-tree and
|
|
Greene's variant of the R-tree. This superiority of the
|
|
R-tree holds for different types of queries and
|
|
operations, such as map overlay, for both rectangles
|
|
and multidimensional points in all experiments. From a
|
|
practical point of view the R-tree is very attractive
|
|
because of the following two reasons: 1. it efficiently
|
|
supports point and spatial data at the same time and 2.
|
|
its implementation cost is only slightly higher than
|
|
that of other R-trees.",
|
|
acknowledgement = ack-nhfb,
|
|
affiliation = "Univ Bremen",
|
|
affiliationaddress = "Bremen, West Ger",
|
|
classification = "723; 921; 922",
|
|
conference = "Proceedings of the 1990 ACM SIGMOD International
|
|
Conference on Management of Data",
|
|
conferenceyear = "1990",
|
|
keywords = "Database Systems; Query Languages; Mathematical
|
|
Techniques --- Trees; Optimization; Computer
|
|
Programming --- Algorithms; R-Trees; Access Methods",
|
|
meetingaddress = "Atlantic City, NJ, USA",
|
|
meetingdate = "May 23--25 1990",
|
|
meetingdate2 = "05/23--25/90",
|
|
publisherinfo = "Fort Collins Computer Center",
|
|
sponsor = "ACM SIGMOD, New York, NY, USA",
|
|
}
|
|
|