Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search.

Giuseppe Ottaviano

Daniel Severo 0001 Giuseppe Ottaviano Matthew J. Muckley Karen Ullrich Matthijs Douze Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search. 2025 January abs/2501.10479 CoRR https://doi.org/10.48550/arXiv.2501.10479 db/journals/corr/corr2501.html#abs-2501-10479 streams/journals/corr

Michele Bevilacqua Giuseppe Ottaviano Patrick Lewis 0001 Scott Yih Sebastian Riedel 0001 Fabio Petroni Autoregressive Search Engines: Generating Substrings as Document Identifiers. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/cd88d62a2063fdaf7ce6f9068fb15dcd-Abstract-Conference.html db/conf/nips/neurips2022.html#BevilacquaOLY0P22

Michele Bevilacqua Giuseppe Ottaviano Patrick Lewis 0001 Wen-tau Yih Sebastian Riedel 0001 Fabio Petroni Autoregressive Search Engines: Generating Substrings as Document Identifiers. 2022 abs/2204.10628 CoRR https://doi.org/10.48550/arXiv.2204.10628 db/journals/corr/corr2204.html#abs-2204-10628

Marco Genuzio Giuseppe Ottaviano Sebastiano Vigna Fast scalable construction of ([compressed] static | minimal perfect hash) functions. 104517 2020 273 Inf. Comput. https://doi.org/10.1016/j.ic.2020.104517 https://www.wikidata.org/entity/Q126344027 db/journals/iandc/iandc273.html#GenuzioOV20

Jui-Ting Huang Ashish Sharma Shuying Sun Li Xia David Zhang Philip Pronin Janani Padmanabhan Giuseppe Ottaviano Linjun Yang Embedding-based Retrieval in Facebook Search. 2553-2561 2020 KDD https://doi.org/10.1145/3394486.3403305 conf/kdd/2020 db/conf/kdd/kdd2020.html#HuangSSXZPPOY20

Jui-Ting Huang Ashish Sharma Shuying Sun Li Xia David Zhang Philip Pronin Janani Padmanabhan Giuseppe Ottaviano Linjun Yang Embedding-based Retrieval in Facebook Search. 2020 abs/2006.11632 CoRR https://arxiv.org/abs/2006.11632 db/journals/corr/corr2006.html#abs-2006-11632

Antonio Mallia Giuseppe Ottaviano Elia Porciani Nicola Tonellotto Rossano Venturini Faster BlockMax WAND with Variable-sized Blocks. 625-634 2017 SIGIR https://doi.org/10.1145/3077136.3080780 conf/sigir/2017 db/conf/sigir/sigir2017.html#MalliaOPTV17 Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev Alon Shalita Compressing Graphs and Indexes with Recursive Graph Bisection. 1535-1544 2016 KDD https://doi.org/10.1145/2939672.2939862 conf/kdd/2016 db/conf/kdd/kdd2016.html#DhulipalaKKOPS16 Marco Genuzio Giuseppe Ottaviano Sebastiano Vigna Fast Scalable Construction of (Minimal Perfect Hash) Functions. 339-352 2016 SEA https://doi.org/10.1007/978-3-319-38851-9_23 conf/wea/2016 db/conf/wea/sea2016.html#GenuzioOV16

Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev Alon Shalita Compressing Graphs and Indexes with Recursive Graph Bisection. 2016 abs/1602.08820 CoRR http://arxiv.org/abs/1602.08820 db/journals/corr/corr1602.html#DhulipalaKKOPS16

Marco Genuzio Giuseppe Ottaviano Sebastiano Vigna Fast Scalable Construction of (Minimal Perfect Hash) Functions. 2016 abs/1603.04330 CoRR http://arxiv.org/abs/1603.04330 db/journals/corr/corr1603.html#GenuzioOV16

Alberto De Francesco Claudia Di Napoli Maurizio Giordano Giuseppe Ottaviano Raffaele Perego 0001 Nicola Tonellotto MIDAS: a cloud platform for SOA testing as a service. 285-300 2015 8 Int. J. High Perform. Comput. Netw. 3 https://doi.org/10.1504/IJHPCN.2015.071254 https://www.wikidata.org/entity/Q61855687 db/journals/ijhpcn/ijhpcn8.html#FrancescoNGOPT15

Giuseppe Ottaviano Nicola Tonellotto Rossano Venturini Optimal Space-time Tradeoffs for Inverted Indexes. 47-56 2015 WSDM https://doi.org/10.1145/2684822.2685297 conf/wsdm/2015 db/conf/wsdm/wsdm2015.html#OttavianoTV15 Roi Blanco Giuseppe Ottaviano Edgar Meij Fast and Space-Efficient Entity Linking for Queries. 179-188 2015 WSDM https://doi.org/10.1145/2684822.2685317 https://www.wikidata.org/entity/Q108712005 conf/wsdm/2015 db/conf/wsdm/wsdm2015.html#BlancoOM15

Roberto Grossi Giuseppe Ottaviano Fast Compressed Tries through Path Decompositions. 2014 19 ACM J. Exp. Algorithmics 1 https://doi.org/10.1145/2656332 db/journals/jea/jea19.html#GrossiO14

Djamal Belazzougui Paolo Boldi Giuseppe Ottaviano Rossano Venturini Sebastiano Vigna Cache-Oblivious Peeling of Random Hypergraphs. 352-361 2014 DCC https://doi.org/10.1109/DCC.2014.48 conf/dcc/2014 db/conf/dcc/dcc2014.html#BelazzouguiBOVV14 Alberto De Francesco Claudia Di Napoli Maurizio Giordano Giuseppe Ottaviano Raffaele Perego 0001 Nicola Tonellotto A SOA Testing Platform on the Cloud: The MIDAS Experience. 659-664 2014 INCoS https://doi.org/10.1109/INCoS.2014.62 https://www.wikidata.org/entity/Q61855691 conf/incos/2014 db/conf/incos/incos2014.html#FrancescoNGOPT14 Giuseppe Ottaviano Rossano Venturini Partitioned Elias-Fano indexes. 273-282 2014 SIGIR https://doi.org/10.1145/2600428.2609615 conf/sigir/2014 db/conf/sigir/sigir2014.html#OttavianoV14 Giuseppe Ottaviano Space-Efficient Data Structures for Collections of Textual Data. University of Pisa, Italy 2013 https://etd.adm.unipi.it/theses/available/etd-05232013-000551/ https://opac.bncf.firenze.sbn.it/bncf-prod/resource?uri=CFI0897557 https://opac.bncf.firenze.sbn.it/bncf-prod/resource?uri=TD20016564 Giuseppe Ottaviano Pushmeet Kohli Compressible Motion Fields. 2251-2258 2013 CVPR https://doi.org/10.1109/CVPR.2013.292 https://doi.ieeecomputersociety.org/10.1109/CVPR.2013.292 conf/cvpr/2013 db/conf/cvpr/cvpr2013.html#OttavianoK13 Roberto Grossi Giuseppe Ottaviano Design of Practical Succinct Data Structures for Large Data Collections. 5-17 2013 SEA https://doi.org/10.1007/978-3-642-38527-8_3 conf/wea/2013 db/conf/wea/sea2013.html#GrossiO13 Bo-June Paul Hsu Giuseppe Ottaviano Space-efficient data structures for Top-<i>k</i> completion. 583-594 2013 WWW https://doi.org/10.1145/2488388.2488440 conf/www/2013 db/conf/www/www2013.html#HsuO13

Djamal Belazzougui Paolo Boldi Giuseppe Ottaviano Rossano Venturini Sebastiano Vigna Cache-Oblivious Peeling of Random Hypergraphs. 2013 abs/1312.0526 CoRR http://arxiv.org/abs/1312.0526 db/journals/corr/corr1312.html#BelazzouguiBOVV13

Giuseppe Ottaviano Roberto Grossi Fast Compressed Tries through Path Decompositions. 65-74 2012 ALENEX https://doi.org/10.1137/1.9781611972924.7 conf/alenex/2012 db/conf/alenex/alenex2012.html#OttavianoG12 Roberto Grossi Giuseppe Ottaviano The wavelet trie: maintaining an indexed sequence of strings in compressed space. 203-214 2012 PODS https://doi.org/10.1145/2213556.2213586 conf/pods/2012 db/conf/pods/pods2012.html#GrossiO12

Roberto Grossi Giuseppe Ottaviano The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space http://arxiv.org/abs/1204.3581 2012 CoRR abs/1204.3581 db/journals/corr/corr1204.html#abs-1204-3581

Giuseppe Ottaviano Roberto Grossi Semi-indexing semi-structured data in tiny space. 1485-1494 2011 CIKM https://doi.org/10.1145/2063576.2063790 https://www.wikidata.org/entity/Q131116070 conf/cikm/2011 db/conf/cikm/cikm2011.html#OttavianoG11

Roberto Grossi Giuseppe Ottaviano Fast Compressed Tries through Path Decompositions http://arxiv.org/abs/1111.5220 2011 CoRR abs/1111.5220 db/journals/corr/corr1111.html#abs-1111-5220

Roberto Grossi Alessio Orlandi Giuseppe Ottaviano Fun with Olympiad in Algorithmics. 1-2 2010 FUN https://doi.org/10.1007/978-3-642-13122-6_1 conf/fun/2010 db/conf/fun/fun2010.html#GrossiOO10 Djamal Belazzougui Michele Bevilacqua Roi Blanco Paolo Boldi Laxman Dhulipala Matthijs Douze Alberto De Francesco Marco Genuzio Maurizio Giordano Roberto Grossi Bo-June Paul Hsu Jui-Ting Huang Igor Kabiljo Brian Karrer Pushmeet Kohli Patrick S. H. LewisPatrick Lewis 0001 Antonio Mallia Edgar Meij Matthew J. Muckley Claudia Di Napoli Alessio Orlandi Janani Padmanabhan Raffaele Perego 0001 Fabio Petroni Elia Porciani Philip Pronin Sergey Pupyrev Sebastian Riedel 0001 Daniel Severo 0001 Alon Shalita Ashish Sharma Shuying Sun Nicola Tonellotto Karen Ullrich Rossano Venturini Sebastiano Vigna Li Xia Linjun Yang Scott YihWen-tau Yih David Zhang