Claudio Gutierrez

Claudio Gutierrez

Auto-generated profile, based on publicly available information

Claudio Gutierrez

University of Chile, Santiago, Chile

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
2 July 2021 in ACM Computing Surveys
Verified
Journal Article
Open access
AHAidan Hogan
Aidan Hogan
EBEva Blomqvist
Eva Blomqvist
MCMichael Cochez
Michael Cochez
CDClaudia D’amato
Claudia D’amato
GMGerard De Melo
Gerard De Melo
AZAntoine Zimmermann
Antoine Zimmermann
In this article, we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse, dynamic, large-scale collections of data. After some opening remarks, we motivate and contrast various graph-based data models, as well as languages used to query and validate knowledge graphs. We explain how knowledge can be represented and extracted using a combination of deductive and inductive techniques. We conclude with high-level future research directions for knowledge graphs.

1 August 2009 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
JPJorge Pérez
Jorge Pérez
MAMarcelo Arenas
Marcelo Arenas
CGClaudio Gutierrez
Claudio Gutierrez
SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity of the evaluation of several fragments of the language. Among other complexity results, we show that the evaluation of general SPARQL patterns is PSPACE-complete. We identify a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently. This restriction gives rise to the class of well-designed patterns. We show that the evaluation problem is coNP-complete for well-designed patterns. Moreover, we provide several rewriting rules for well-designed patterns whose application may have a considerable impact in the cost of evaluating SPARQL queries.

22 February 2008 in ACM Computing Surveys
Verified
Journal Article
Open access
RARenzo Angles
Renzo Angles
CGClaudio Gutierrez
Claudio Gutierrez
Graph database models can be defined as those in which data structures for the schema and instances are modeled as graphs or generalizations of them, and data manipulation is expressed by graph-oriented operations and type constructors. These models took off in the eighties and early nineties alongside object-oriented models. Their influence gradually died out with the emergence of other database models, in particular geographical, spatial, semistructured, and XML. Recently, the need to manage information with graph-like nature has reestablished the relevance of this area. The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.

1 January 2006
Verified
Book Chapter
Closed access
PDF file
JPJorge Pérez
Jorge Pérez
MAMarcelo Arenas
Marcelo Arenas
CGClaudio Gutierrez
Claudio Gutierrez

1 March 2013 in Journal of Web Semantics
Verified
Journal Article
Closed access
JFJavier D. Fernández
Javier D. Fernández
MMMiguel A. Martínez-Prieto
Miguel A. Martínez-Prieto
CGClaudio Gutiérrez
Claudio Gutiérrez
APAxel Polleres
Axel Polleres
MAMario Arias
Mario Arias

26 December 2006 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CGClaudio Gutierrez
Claudio Gutierrez
CHCarlos A. Hurtado
Carlos A. Hurtado
AVAlejandro Vaisman
Alejandro Vaisman
The resource description framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yielding temporal RDF graphs. We present a semantics for these kinds of graphs which includes the notion of temporal entailment and a syntax to incorporate this framework into standard RDF graphs, using the RDF vocabulary plus temporal labels. We give a characterization of temporal entailment in terms of RDF entailment and show that the former does not yield extra asymptotic complexity with respect to nontemporal RDF graphs. We also discuss temporal RDF graphs with anonymous timestamps, providing a theoretical framework for the study of temporal anonymity. Finally, we sketch a temporal query language for RDF, along with complexity results for query evaluation that show that the time dimension preserves the tractability of answers