Parallel query processing on distributed clustering indexes

DOI10.1016/J.JDA.2008.09.010zbMATH Open1162.68012OpenAlexW2063907387MaRDI QIDQ1013068FDOQ1013068

Mauricio Marin, Veronica Gil-Costa, Nora Reyes

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.010

zbMATH Keywords

parallel and distributed computingmetric space databasesquery processing and indexing

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Database theory (68P15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clustering to minimize the maximum intercluster distance
• Satisfying general proximity/similarity queries with metric trees
• Some approaches to best-match file searching
• Similarity search. The metric space approach.
• A Data Structure and an Algorithm for the Nearest Point Problem
• Computational Science – ICCS 2005
• Fixed queries array: A fast and economical data structure for proximity searching
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• On the Least Cost for Proximity Searching in Metric Spaces

Cited In (6)

• Parallel processing of very large databases using distributed column indexes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sync/Async parallel search for the efficient design and construction of web search engines
• Query processing in a DBMS for cluster systems
• High Performance Computing for Computational Science - VECPAR 2004

This page was built for publication: Parallel query processing on distributed clustering indexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013068)