Grant: Discovery Grants Program - Individual
University of Alberta
$30,000.00
Enabling queries on relational data on the Web
FY 2017-18
Summary
While the World Wide Web provides public access to one of the largest and most heterogeneous data collections ever created, its querying capabilities have remained very much limited to keyword search. This reduces the efficiency of the search and the scope of the information that can be explored or retrieved. More specifically, a keyword search is not sufficient when the search is not bounded to a selection and involves join and set operations over the contents of the documents. For instance, a keyword search is not appropriate for querying relationships, and the Web contains relationships galore. Also, a keyword search is not very applicable when the granularity of the search result is smaller than a document, and the result is a more refined set of items or entities that satisfy some conditions.This proposal is to study and to address some of the issues that hinder querying relational data on the Web, in particular: (1) On extracting and aggregating information, we will study the relationships between different encoding schemes and the conditions under which two encodings may refer to or describe the same fact or express the same relationship. Understanding such relationships is a key in, for example, detecting if a query matches a piece of data, aggregating related pieces and filtering unrelated pieces. (2) On relevance ranking, we will be investigating models that can explain the conditions under which a fact or relationship is more reliable or trustworthy and the relationships between trustworthiness and relevance. (3) On data cleaning and filtering, we will explore strategies and filters that can be used to clean up resources that may introduce noise in the result, and more scalable data structures and algorithms to implement those filters. (4) A better understanding of the aforementioned issues and the solutions that we develop will enable us to look for more advanced searching and querying formulations. Investigating these formulations would further provide us with more opportunities to explore more efficient query evaluation strategies that are applicable in the setting of the Web.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
239127-2013
Name nom
Rafiei, Davood
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2013
Award amount
30000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2711
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Database management
Research subject fr
Gestion de bases de données
Partie
5
Nb partie
5
Application title
Enabling queries on relational data on the Web
Keyword
NSERC
Application summary
While the World Wide Web provides public access to one of the largest and most heterogeneous data collections ever created, its querying capabilities have remained very much limited to keyword search. This reduces the efficiency of the search and the scope of the information that can be explored or retrieved. More specifically, a keyword search is not sufficient when the search is not bounded to a selection and involves join and set operations over the contents of the documents. For instance, a keyword search is not appropriate for querying relationships, and the Web contains relationships galore. Also, a keyword search is not very applicable when the granularity of the search result is smaller than a document, and the result is a more refined set of items or entities that satisfy some conditions.This proposal is to study and to address some of the issues that hinder querying relational data on the Web, in particular: (1) On extracting and aggregating information, we will study the relationships between different encoding schemes and the conditions under which two encodings may refer to or describe the same fact or express the same relationship. Understanding such relationships is a key in, for example, detecting if a query matches a piece of data, aggregating related pieces and filtering unrelated pieces. (2) On relevance ranking, we will be investigating models that can explain the conditions under which a fact or relationship is more reliable or trustworthy and the relationships between trustworthiness and relevance. (3) On data cleaning and filtering, we will explore strategies and filters that can be used to clean up resources that may introduce noise in the result, and more scalable data structures and algorithms to implement those filters. (4) A better understanding of the aforementioned issues and the solutions that we develop will enable us to look for more advanced searching and querying formulations. Investigating these formulations would further provide us with more opportunities to explore more efficient query evaluation strategies that are applicable in the setting of the Web.