Extending SQL to support unary similary queries

Author(s)

Mônica Ribeiro Porto Ferreira

• Document type: Master's Dissertation
• Press: São Carlos.
• Institution: Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB)
• Defense date: 2008-02-15

Examining board members

Caetano Traina Junior; Mauro Biajiz; Alexandre Plastino de Carvalho

• Advisor: Caetano Traina Junior

Abstract

Conventional operators for data comparison based on exact matching and total order relations are not appropriate to manage complex data, such as multimedia data (e.g. images, audio and large texts), time series and genetic sequences. In fact, the most important aspect to compare complex data is usually the similarity degree between instances, leading to the use of similarity operators to perform search and retrieval operations. Similarity operators can be classified as unary or as binary, respectively used to implement selection operations and joins. However, the Relation Algebra, employed in Relational Database Management Systems (DBMS), does not provide resources to express similarity search criteria. In order to fulfill this lack of support, an extension to the Relational Algebra is under development at GBdI-ICMC-USP (Grupo de Bases de Dados e Imagens), aiming to represent similarity queries in algebraic expressions. This work contributes to such an effort by dealing with unary similarity operators in Relational Algebra and by developing a similarity query optimizer for SIREN (Similarity Retrieval Engine), therefore allowing similarity queries to be answered by Relational DBMS (AU)

• FAPESP's process: 05/03341-7 - Extending SQL to support unary similary queries
• Grantee: Mônica Ribeiro Porto Ferreira
• Support Opportunities: Scholarships in Brazil - Master