Este trabajo presenta una revisi´on de los m´etodos de
compresi´on de textos, que permiten la busqueda ´ directa de palabras y
frases dentro del texto sin necesidad de descomprimirlo.
Se presentan las t´ecnicas de ...
In this paper we present the architecture of a system to store,
query and visualize on the web large datasets of geographic information.
The architecture includes a component to simulate a large number of
drivers that ...
A critical issue in large scale search engines is to efficiently
handle sudden peaks of incoming query traffic. Research in metric spaces
has addressed this problem from the point of view of creating caches that
provide ...
In this paper we address the problem by using several compression-inspired strategiesthat generate different models without analyzing or extracting specific features from thetextual content, making them style-oblivious ...
Gilberto, Gutiérrez(Gilberto Gutiérrez et al., 2023)
Given a set S of points in the two-dimensional space, which are stored
in a spatial database, this paper presents an efficient algorithm to find the empty
circle, in the area delimited by those points, with the largest ...
In this paper, we propose a compact data structure to store labeled at-tributed graphs based on thek2-tree, which is a very compact data structure designedto represent a simple directed graph. The idea we propose ...
Nieves R., Brisaboa; Gómez-Brandón, Adrián; Navarro, Gonzalo; R.Paramá, José(2019)
We present a compressed data structure to store free tra-jectories of moving objects (ships over the sea, for example) allowingspatio-temporal queries. Our method, GraCT, uses ak2-tree to store theabsolute positions of all ...
RDF compression and querying are consolidated topics in the Web
of Data, with a plethora of solutions to efficiently store and query
static datasets. However, as RDF data changes along time, it
becomes necessary to keep ...