Titel

Merkliste
1 Ergebnisse

Cache-oblivious R-trees:

, In: Proceedings of the twenty-first annual symposium on Computational geometry,

Arge, Lars ; de Berg, Mark ; Haverkort, Herman - p. 170-179 , 2005

Link: https://dl.acm.org/doi/10.1145/1064092.1064120

RT 
T1 <cTitle>Proceedings of the twenty-first annual symposium on Computational geometry</cTitle>: T1 <Title>Cache-oblivious R-trees</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-1064120&Exemplar=1&LAN=DE
				
A1 Arge, Lars
A1 de Berg, Mark
A1 Haverkort, Herman
PB ACM
YR 2005
K1 I/O-efficiency
K1 R-trees
K1 cache-oblivious data structures
K1 geometric data structures
K1 Theory of computation
K1 Theory and algorithms for application domains
K1 Database theory
K1 Data structures and algorithms for data management
K1 Software and its engineering
K1 Software notations and tools
K1 General programming languages
K1 Language features
K1 Data types and structures
K1 Information systems
K1 Data management systems
K1 Data structures
K1 Design and analysis of algorithms
K1 Data structures design and analysis
K1 Information storage systems
K1 Record storage systems
SP 170
OP 179
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1064092.1064120
DO https://dl.acm.org/doi/10.1145/1064092.1064120
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)