Spaces, trees, and colors: The algorithmic landscape of document retrieval on sequences
G Navarro - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …
From theory to practice: Plug and play with succinct data structures
Engineering efficient implementations of compact and succinct structures is time-consuming
and challenging, since there is no standard library of easy-to-use, highly optimized, and …
and challenging, since there is no standard library of easy-to-use, highly optimized, and …
When search engine services meet large language models: visions and challenges
Combining Large Language Models (LLMs) with search engine services marks a significant
shift in the field of services computing, opening up new possibilities to enhance how we …
shift in the field of services computing, opening up new possibilities to enhance how we …
Top-k Document Retrieval in Optimal Time and Linear Space
We describe a data structure that uses O (n)-word space and reports k most relevant
documents that contain a query pattern P in optimal O (| P|+ k) time. Our construction …
documents that contain a query pattern P in optimal O (| P|+ k) time. Our construction …
State-of-the-art in string similarity search and join
String similarity search and its variants are fundamental problems with many applications in
areas such as data integration, data quality, computational linguistics, or bioinformatics. A …
areas such as data integration, data quality, computational linguistics, or bioinformatics. A …
Efficient compression of 4D-trajectory data in air traffic management
Air traffic management (ATM) is facing a tremendous increase in the amount of available
flight data, particularly four-dimensional (4D) trajectories. Computational requirements for …
flight data, particularly four-dimensional (4D) trajectories. Computational requirements for …
Space-Efficient Frameworks for Top-k String Retrieval
The inverted index is the backbone of modern web search engines. For each word in a
collection of web documents, the index records the list of documents where this word occurs …
collection of web documents, the index records the list of documents where this word occurs …
A generic inverted index framework for similarity search on the gpu
J Zhou, Q Guo, HV Jagadish, L Krcal… - 2018 IEEE 34th …, 2018 - ieeexplore.ieee.org
We propose a novel generic inverted index framework on the GPU (called GENIE), aiming to
reduce the programming complexity of the GPU for parallel similarity search of different data …
reduce the programming complexity of the GPU for parallel similarity search of different data …
Join optimization for inverted index technique on relational database management systems
In relational database management systems (RDBMSs), an efficient join method for text
retrieval using an inverted index has been developed and implemented. However, the …
retrieval using an inverted index has been developed and implemented. However, the …
Ranked document retrieval for multiple patterns
Abstract Let D={T 1, T 2,…, TD} be a collection of D documents having n characters in total.
Given two patterns P and Q, and an integer k> 0, we consider the following queries.• top-k …
Given two patterns P and Q, and an integer k> 0, we consider the following queries.• top-k …