{"content":[{"text":"Summary Prefix Tree: An over DHT Indexing Data \n Structure for Eﬀicient Superset Search \n Bassirou Ngom, Mesaac Makpangou","bbox":{"left":0.154625,"top":0.274974,"width":0.742169,"height":0.08010099999999998}},{"text":"To cite this version: \n Bassirou Ngom, Mesaac Makpangou. Summary Prefix Tree: An over DHT Indexing Data Structure for \n Eﬀicient Superset Search. NCA 2017 - 16th IEEE International Symposium on Network Computing \n and Applications, Oct 2017, Cambridge, MA, United States. pp.1-5, 10.1109/NCA.2017.8171372. \n hal-01672052","bbox":{"left":0.131662,"top":0.408643,"width":0.809515,"height":0.09995600000000004}},{"text":"HAL Id: hal-01672052 \n https://hal.inria.fr/hal-01672052 \n Submitted on 23 Dec 2017","bbox":{"left":0.305465,"top":0.667864,"width":0.389045,"height":0.07521199999999995}},{"text":"HAL is a multi-disciplinary open access \n archive for the deposit and dissemination of sci- \n entific research documents, whether they are pub- \n lished or not. The documents may come from \n teaching and research institutions in France or \n abroad, or from public or private research centers.","bbox":{"left":0.095238,"top":0.799809,"width":0.396409,"height":0.09890699999999997}},{"text":"L’archive ouverte pluridisciplinaire HAL, est \n destinée au dépôt et à la diffusion de documents \n scientifiques de niveau recherche, publiés ou non, \n émanant des établissements d’enseignement et de \n recherche français ou étrangers, des laboratoires \n publics ou privés.","bbox":{"left":0.508364,"top":0.799809,"width":0.39640999999999993,"height":0.09890699999999997}}],"images_bbox":[{"left":0.424521,"top":0.054944,"width":0.20238,"height":0.080282},{"left":0.120951,"top":0.417063,"width":0.013389,"height":0.010955}],"images_bbox_not_text_overlap":[{"left":0.424521,"top":0.054944,"width":0.20238,"height":0.080282},{"left":0.120951,"top":0.417063,"width":0.013389,"height":0.010955}]}