Vicente Calisto

Vicente Calisto

Auto-generated profile, based on publicly available information

Vicente Calisto

PUC Chile & IMFD Chile, Santiago, Chile

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 June 2024
Verified
Conference Paper
Open access
DVDomagoj Vrgoc
Domagoj Vrgoc
CRCarlos Rojas
Carlos Rojas
RARenzo Angles
Renzo Angles
MAMarcelo Arenas
Marcelo Arenas
VCVicente Calisto
Vicente Calisto
ETEtienne Toussiant
Etienne Toussiant
Current knowledge graphs encompass diverse data formats, including images, text, tables, audio files, and videos. Additionally, the graph database ecosystem is required to support multiple co-existing data models. Addressing these challenges is essential for promoting interoperability between data sources. This demo introduces MillenniumDB, a high-performing, open-source graph database handling this diversity of data formats and models. MillenniumDB is a multi-modal, multi-model graph database, supporting the popular property graph paradigm, the Semantic Web format RDF, and the multi-layered graph model, which combines and extends the two. In terms of querying, its provides support for a Cypher-like language over property graphs and multilayered graphs, as well as SPARQL 1.1 support over RDF. The engine is build on a solid theoretical foundation and it leverages worst-case optimal join algorithms in combination with traditional relational query optimization. It also support a wide array of graph-specific tasks such as path finding, pattern recognition, and similarity search on multi-modal data. In this demo, we will showcase how MillenniumDB is currently being used to host three public multi-modal knowledge graphs. The first one, a multi-layered graph called TelarKG, was developed at IMFD Chile to track the information about the Chilean constitutional reform. In the second one, called BibKG, we integrate information about Computer Science publications from different sources and make them available as a property graph. Finally, for RDF, we provide a SPARQL endpoint for Wikidata, the largest knowledge graph openly available online. We remark that our endpoints have stable links, allowing the audience to post queries using their Web browser with no restrictions, and will be available during the review process and during the demo.

9 June 2024
Verified
Conference Paper
Open access
RARenzo Angles
Renzo Angles
VCVicente Calisto
Vicente Calisto
JDJaviera Díaz
Javiera Díaz
SFSebastián Ferrada
Sebastián Ferrada
AHAidan Hogan
Aidan Hogan
DVDomagoj Vrgoč
Domagoj Vrgoč
In this paper we present TelarKG, a knowledge graph (KG) that consolidates multiple sources of information regarding the Chilean Constitutional process, particularly about the work of the members of the Constitutional Convention. TelarKG contains a wide range of public data, such as the materials from the commissions and information about the members' interventions and votes. In addition, the KG has been enriched with online user-generated content including posts from social networks related to the constitutional process, and transcriptions from the YouTube videos of the plenary sessions. Among other features, TelarKG leverages the semantic similarity search capabilities of the MillenniumDB endpoint to compute text similarity among convention members' Twitter messages. Additionally, we employ Entity Linking techniques to identify references to members of the Convention and Parties within these messages. TelarKG constitutes one of the most comprehensive historical archives on a political event, enabling users to query and navigate through diverse aspects of Chile's constitutional process.

9 June 2024
Verified
Conference Paper
Open access
KBKyle Bossonney
Kyle Bossonney
VCVicente Calisto
Vicente Calisto
CRCristian Riveros
Cristian Riveros
GTGustavo Toro
Gustavo Toro
NJNicolás Van Sint Jan
Nicolás Van Sint Jan
DVDomagoj Vrgoč
Domagoj Vrgoč
In this demonstration we showcase REmatch, a regular expression (RegEx) engine built to find all matches of a given pattern in a document. REmatch is based on the theory of enumeration algorithms, and it extends the capability of classical regex engines with the ability to find nested and overlapping matches with a simple and intuitive syntax, and no need to use non-standard operators, while at the same time maintaining efficient performance. The algorithmic core of REmatch is an algorithm that builds a compressed representation of all matching results and enumerates them on demand in time proportional to writing them down symbol by symbol. For this demonstration, we developed a simple Web interface to access the REmatch engine, available at https://rematch.cl, and will showcase the utility of the engine in the context of analysing DNA sequences, linguistic analysis, among others. For this, we have prepared a series of examples that illustrate the expressiveness and ease of use of REmatch. Additionally, at the demo we will have a series of challenge tasks, asking attendees to capture the result set of a simple REmatch expression using their favourite RegEx engine.

22 June 2025
Verified
Conference Paper
Open access
KBKyle Bossonney
Kyle Bossonney
NBNicolás Buzeta
Nicolás Buzeta
VCVicente Calisto
Vicente Calisto
JLJuan-Eduardo López
Juan-Eduardo López
CRCristian Riveros
Cristian Riveros
SVStijn Vansummeren
Stijn Vansummeren

29 October 2025
Verified
Book Chapter
Closed access
PDF file
VCVicente Calisto
Vicente Calisto
SFSebastián Ferrada
Sebastián Ferrada
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
JRJuan L. Reutter
Juan L. Reutter
JSJuan Pablo Sánchez
Juan Pablo Sánchez
DVDomagoj Vrgoč
Domagoj Vrgoč