Listar Laboratorio de Bases de Datos (LBD) por data de publicación
Mostrando ítems 1-20 de 38
-
Aggregated 2D range queries on clustered points
(Elsevier Ltd, 2016-09)[Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. ... -
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
(Springer, 2016-09-21)[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ... -
Compact Trip Representation over Networks
(Springer, 2016-09-21)[Abstract] We present a new Compact Trip Representation ( CTRCTR ) that allows us to manage users’ trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where ... -
GraCT: A Grammar Based Compressed Representation of Trajectories
(Springer, 2016-09-21)[Abstract] We present a compressed data structure to store free trajectories of moving objects (ships over the sea, for example) allowing spatio-temporal queries. Our method, GraCT, uses a k2k2 -tree to store the absolute ... -
Efficient Representation of Multidimensional Data over Hierarchical Domains
(Springer, 2016-09-21)[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ... -
Parallel construction of wavelet trees on multicore architectures
(Springer U K, 2016-10-05)[Abstract] The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem ... -
Grammar compressed sequences with rank/select support
(Elsevier BV, 2016-10-14)[Abstract] Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need ... -
A succinct data structure for self-indexing ternary relations
(Elsevier BV, 2016-10-27)[Abstract] The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary ... -
Universal indexes for highly repetitive document collections
(Elsevier Ltd, 2016-11)[Abstract] Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are ... -
A New Method to Index and Store Spatio-Temporal Data
(2016-11-16)[Abstract] We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, ... -
Navigational Rule Derivation: An algorithm to determine the effect of traffic signs on road networks
(2016-11-17)[Abstract] In this paper we present an algorithm to build a road network map enriched with traffic rules such as one-way streets and forbidden turns, based on the interpretation of already detected and classified traffic ... -
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication
(IEEE Computer Society, 2018-03)[Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ... -
Design of Mutation Operators for Testing Geographic Information Systems
(M D P I AG, 2019-08-06)[Abstract] In this article, we propose the definition of specific mutation operators for testing Geographic Information Systems. We describe the process for applying the operators and generating mutants, and present a case ... -
Energy Consumption in Compact Integer Vectors: A Study Case
(Institute of Electrical and Electronics Engineers, 2019-10-25)[Abstract] In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy consumption. Moreover, most of the ... -
Improved Compressed String Dictionaries
(ACM, 2019-11-03)[Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ... -
Efficient Processing of Raster and Vector Data
(Public Library of Science, 2020-01-10)[Abstract] In this work, we propose a framework to store and manage spatial data, which includes new efficient algorithms to perform operations accepting as input a raster dataset and a vector dataset. More concretely, we ... -
Compressed Data Structures for Binary Relations in Practice
(Institute of Electrical and Electronics Engineers, 2020-01-31)[Abstract] Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent ... -
An Action Research for Improving the Sustainability Assessment Framework Instruments
(MDPI AG, 2020-02-24)[Abstract] In the last years, software engineering researchers have defined sustainability as a quality requirement of software, but not enough effort has been devoted to develop new methods/techniques to support the ... -
Towards a Non-Functional Requirements Discovery Approach for Persuasive Systems
(Association for Computing Machinery, 2020-03-30)[Abstract] A number of software systems that attempt to help people achieve behavior change have been proposed in various domains such as health and wellness. However, sometimes, such systems have failed to provide a ... -
A Public Domain Dataset for Real-Life Human Activity Recognition Using Smartphone Sensors
(MDPI AG, 2020-04-13)[Abstract] In recent years, human activity recognition has become a hot topic inside the scientific community. The reason to be under the spotlight is its direct application in multiple domains, like healthcare or fitness. ...
