Sorry, you need to enable JavaScript to visit this website.

Computation over Compressed Data

Semantrix: A Compressed Semantic Matrix


We present a compact data structure to represent both the duration and length of homogeneous segments of trajectories from moving objects in a way that, as a data warehouse, it allows us to efficiently answer cumulative queries. The division of trajectories into relevant segments has been studied in the literature under the topic of Trajectory Segmentation. In this paper, we design a data structure to compactly represent them and the algorithms to answer the more relevant queries.

Paper Details

Authors:
Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro
Submitted On:
20 March 2020 - 3:35pm
Short Link:
Type:
Event:
Presenter's Name:
Session:
Document Year:
Cite

Document Files

DCC20.pdf

(83)

Keywords

Additional Categories

Subscribe

[1] Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, "Semantrix: A Compressed Semantic Matrix", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5011. Accessed: Sep. 26, 2020.
@article{5011-20,
url = {http://sigport.org/5011},
author = {Nieves R. Brisaboa; Antonio Fariña; Gonzalo Navarro },
publisher = {IEEE SigPort},
title = {Semantrix: A Compressed Semantic Matrix},
year = {2020} }
TY - EJOUR
T1 - Semantrix: A Compressed Semantic Matrix
AU - Nieves R. Brisaboa; Antonio Fariña; Gonzalo Navarro
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5011
ER -
Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro. (2020). Semantrix: A Compressed Semantic Matrix. IEEE SigPort. http://sigport.org/5011
Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, 2020. Semantrix: A Compressed Semantic Matrix. Available at: http://sigport.org/5011.
Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro. (2020). "Semantrix: A Compressed Semantic Matrix." Web.
1. Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro. Semantrix: A Compressed Semantic Matrix [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5011

Bitvectors with runs and the successor/predecessor problem


The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater or smaller than a given value. This problem has interesting applications, like the intersection of inverted lists. It can be easily modeled by using a bitvector of size n and its operations rank and select. However, there is a practical approach [1], which keeps the best theoretical bounds, and allows to solve successor and predecessor more efficiently.

Paper Details

Authors:
Submitted On:
20 March 2020 - 3:47pm
Short Link:
Type:
Event:
Presenter's Name:
Session:

Document Files

zombit-vector-presentation.pdf

(91)

Keywords

Additional Categories

Subscribe

[1] , "Bitvectors with runs and the successor/predecessor problem", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5009. Accessed: Sep. 26, 2020.
@article{5009-20,
url = {http://sigport.org/5009},
author = { },
publisher = {IEEE SigPort},
title = {Bitvectors with runs and the successor/predecessor problem},
year = {2020} }
TY - EJOUR
T1 - Bitvectors with runs and the successor/predecessor problem
AU -
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5009
ER -
. (2020). Bitvectors with runs and the successor/predecessor problem. IEEE SigPort. http://sigport.org/5009
, 2020. Bitvectors with runs and the successor/predecessor problem. Available at: http://sigport.org/5009.
. (2020). "Bitvectors with runs and the successor/predecessor problem." Web.
1. . Bitvectors with runs and the successor/predecessor problem [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5009