Publication
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, but data heterogeneities often demand for more complex query types, particularly similarity queries. In this work, we suggest a vertical data organization, which allows for efficient processing of similarity queries on instance as well as on schema level, and we introduce corresponding physical similarity operators. Our novel approach is shown to be suitable in conjunction with P-Grid, as an example of robust, large-scaled and self-organizing P2P systems.
Henry Markram, Henry Genet, Alejandra Garcia Rojas Martinez, Sean Lewis Hill, Huanxiang Lu, Mohameth François Sy, Samuel Claude Kerrien, Michaël Fernand Paul Dupont, Silvia Rosario Jimenez Tejeda, Bogdan Roman, Ian Lavriushev, Anna-Kristin Kaufmann, Didac Montero Mendez, Wojciech Adam Wajerowicz, Pierre-Alexandre Fonta, Kenneth William Pirman, Julien Antonin Machon, Jonathan Raël Lurie, Dhanesh Neela Mana, Natalia Stafeeva, Alexander Désiré Ulbrich, Carolina Johanna Elisabeth Lindqvist
Christoph Koch, Sachin Basil John, Peter Lindner, Zhekai Jiang