Tree-based indexing methods for similarity search in metric and nonmetric spaces. Department of Software Engineering Faculty of Mathematics and Physics Charles University in Prague Mgr. Jakub Lokoč Supervisor: Doc. RNDr . Tom áš Skopal , Ph.D. Presentation outline. Introduction
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Tree-based indexing methods for similarity search in metric and nonmetric spaces
Department of Software Engineering
Faculty of Mathematics and Physics
Charles University in Prague
Mgr. Jakub Lokoč
Supervisor: Doc. RNDr. TomášSkopal, Ph.D.
MFF UK, Prague
MFF UK, Prague
query object
Feature extraction
Similarity evaluation
Feature extraction
MFF UK, Prague
MFF UK, Prague
range query
Q
(euclidean 2D space)
MFF UK, Prague
O5
O3
O1
O7
O9
O4
O5
O1
O4
O6
O1
O3
O11
O11
O5
O2
O7
STACK
O8
O9
O10
O2
O8
O6
O9
O10
MFF UK, Prague
CoPhIR (color layout and structure), dim 76, dbSize250.000
MFF UK, Prague
1. Aggregation
2. Parallel batch loading
3. Traditional inserting
Not inserted objects
“Split generating” – will be inserted in traditional way (exploiting limited parallelism)
Postponed – will be inserted during the next batch
CoPhIR 1.000.000
Dimension 76 (12 + 64)
L5.123456 distance
24 / 25 inner/leaf node size
512MB cache size
Identity
Non-negativity
Symmetry
Triangle inequality
2NN ( ) = { , }
2NN ( ) = { , }
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
Ciaccia, P., Patella, M., and Zezula, P.
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB1997
Zezula, P., Savino, P., Rabitti, F., Amato, G., and Ciaccia, P.
Processing M-Tree with Parallel Resources
EDBT 1998
Skopal, T., Pokorny, J., Kratky, M., and Snasel, V.
Revisiting M-tree Building Principles
ADBIS 2003, LNCS 2798, Springer
Skopal T.
Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces
TODS 2007, ACM
MFF UK, Prague
Lokoc J. and SkopalT.
On Reinsertions in M-tree
SISAP 2008, IEEE
SkopalT. and Lokoc J.
NM-Tree: Flexible Approximate SimilaritySearch in Metric and Non-metric Spaces
DEXA 2008, LNCS 5181, Springer
Skopal T. and Lokoc J.
New Dynamic Construction Techniquesfor M-tree
JournalofDiscreteAlgorithms, Elsevier 2009
Lokoc J.
Parallel Dynamic Batch Loading in the M-tree
SISAP 2009, IEEE
J. Novák, T. Skopal, D. Hoksza, J. Lokoč
Improving the Similarity Search of Tandem Mass Spectra using Metric Access Methods
SISAP 2010, ACM
J. Lokoč, T. Skopal
On Applications of Parameterized Hyperplane Partitioning
SISAP 2010, ACM
T. Skopal, J. Lokoč
Answering Metric Skyline Queries by PM-tree
DATESO 2010, CEUR
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
Thank for your attention
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
MFF UK, Prague
All other comments will be updated for online version and I thank for them
MFF UK, Prague