Banca de QUALIFICAÇÃO: FRED DE CASTRO SANTOS

Uma banca de QUALIFICAÇÃO de MESTRADO foi cadastrada pelo programa.
DISCENTE : FRED DE CASTRO SANTOS
DATA : 27/10/2017
HORA: 08:30
LOCAL: Auditório I do DIMAp
TÍTULO:

A mechanism to evaluate context-free queries inspired in LR(1) parsers over graph databases


PALAVRAS-CHAVES:

Graph databases; Query language expressiveness; RDF; LR(1) languages.


PÁGINAS: 49
GRANDE ÁREA: Ciências Exatas e da Terra
ÁREA: Ciência da Computação
SUBÁREA: Teoria da Computação
ESPECIALIDADE: Linguagem Formais e Autômatos
RESUMO:

The World Wide Web is an always increasing collection of information. This informa- tion is spread among different documents, which are made available by using the Hypertext Transfer Protocol (HTTP). Even though this information is accessible to users in the form of news articles, audio broadcasts, images and videos, software agents often cannot classify it. The lack of semantic information about these documents in a machine readable format often causes the analysis to be inaccurate. A significant number of entities have adopted Linked Data as a way to add semantic information to their data, not just publishing it on the Web. The result is a global data collection, called the Web of Data, which forms a global graph, consisting of RDF statements from numerous sources, covering all sorts of topics. To be able to find specific information in this data, queries are performed by starting in a subject and analyzing its predicates in the RDF statements. These predi- cates are the connections between the subject and object, and a list of predicates between two subject form an information path. Given that a trace is a list of predicates in an information path, one can tell there is a connection between subject1 and object1 if there is a trace between them in the RDF statements.

The use of HTTP as a standardized data access mechanism and RDF as a standard data model simplifies the data access, but accessing heterogeneous data on distinct lo- cations can have an increased time complexity and reduced query expressiveness, which motivates us to research alternatives in how this data is queried. Since most of the specified graph database query languages use Regular Expressions, we propose to take a different path and aim on using a less restrictive grammar class, called Context-Free Grammar, to increase the expressiveness of the graph database queries. More specifically, applying the LR(1) parsing method to find paths in an RDF graph database. In this document, we introduce some of the concepts needed for better understanding the given problems and how to solve them; We analyze some works related to our research; and suggest a new solution, using LR(1) parsing concepts to query the database.


MEMBROS DA BANCA:
Presidente - 1495704 - UMBERTO SOUZA DA COSTA
Interno - 1639701 - MARCEL VINICIUS MEDEIROS OLIVEIRA
Interno - 1221251 - MARTIN ALEJANDRO MUSICANTE
Externo ao Programa - 1845280 - SERGIO QUEIROZ DE MEDEIROS
Notícia cadastrada em: 17/10/2017 10:43
SIGAA | Superintendência de Informática - | | Copyright © 2006-2020 - UFRN - sigaa14-producao.info.ufrn.br.sigaa14-producao