I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
The R*-tree: an efficient and robust access method for poin..:
, In:
Proceedings of the 1990 ACM SIGMOD international conference on Management of data
,
Beckmann, Norbert
;
Kriegel, Hans-Peter
;
Schneider, Ralf
. - p. 322-331 , 1990
Link:
https://dl.acm.org/doi/10.1145/93597.98741
RT T1 <cTitle>Proceedings of the 1990 ACM SIGMOD international conference on Management of data</cTitle>: T1 <Title>The R*-tree: an efficient and robust access method for points and rectangles</Title> UL https://suche.suub.uni-bremen.de/peid=acm-98741&Exemplar=1&LAN=DE A1 Beckmann, Norbert A1 Kriegel, Hans-Peter A1 Schneider, Ralf A1 Seeger, Bernhard PB ACM YR 1990 K1 Information systems K1 Information storage systems K1 Record storage systems K1 Directory structures K1 B-trees K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Trees K1 Data management systems K1 Database design and models K1 Theory of computation K1 Design and analysis of algorithms K1 Data structures design and analysis K1 Sorting and searching SP 322 OP 331 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/93597.98741 DO https://dl.acm.org/doi/10.1145/93597.98741 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
