Revisiting M-tree Building Principles.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F03%3A00002541" target="_blank" >RIV/00216208:11320/03:00002541 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/03:03089584
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Revisiting M-tree Building Principles.
Original language description
We introduce two new dynamic techniques of building the M-tree. We also present comparative experimental results on large datasets showing that the new techniques outperform by far even the static bulk-loading algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proc. of ADBIS 2003
ISBN
3-54-020047-9
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
148-162
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—