Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Concordia University

$16,000.00

Towards advanced data management systems

FY 2009-10

Summary
This research aims at development of advanced data management techniques, which uses and/or extends existing database theory and technology for modeling data and processing queries required in numerous emerging applications. Examples of such data includes logical data, uncertainty data, web logs, sequence data, etc. Our focus is on logical data and sequence data. We consider logical data in information integration and study query rewriting and evaluation of conjunctive queries using views, where the queries and views are logical rules possibly extended with constraints which are linear arithmetic comparisons. Literature discusses attribute comparisons and for certain classes of connstraints practical solutions are developed to find maximally contained rewritings, when exists, for queries with all but inequality comparisons. We will develop constraints resolution and optimization modules for the rewriting algoritms in our context above. This extends our results in CoopIS 2005, where we considered constraints which are linear arithmetic expressions with equality. In another research theme in this proposal, we investigate modeling and processing sequence data, which do not have any structure. Emerging applications generate and use enormous amounts of such data. We focus more on biological sequences: DNA and proteins. The main issues are the required uge storage space and lengthy process of index construction. Further, efficient support for exact match and approximate searching is central to such applications. Hence a desired solution should be space efficient, scalable, with resonable index construction time and efficient various search tecniques. While string searching is not new, the enormous size of ever-growing biological sequences, and the variety and volume of queries to be supported pose new research challenges. There is a growing need for more sophisicated indexing structures and techniques. Based on our results in CIKM 2005, the expected contributions of this work include both theoretical and practical advances in the management of biological sequence data.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250351-2007
Name nom
ShiriVarnaamkhaasti, Nematollaah
Department département
Computer Science and Software Engineering
Organization id
70
Institution établissement
Concordia University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2007
Award amount
16000
Program id
RGPIN
Program nane 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
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
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
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Partie
3
Nb partie
3
Application title
Towards advanced data management systems
Keyword
NA
Application summary
This research aims at development of advanced data management techniques, which uses and/or extends existing database theory and technology for modeling data and processing queries required in numerous emerging applications. Examples of such data includes logical data, uncertainty data, web logs, sequence data, etc. Our focus is on logical data and sequence data. We consider logical data in information integration and study query rewriting and evaluation of conjunctive queries using views, where the queries and views are logical rules possibly extended with constraints which are linear arithmetic comparisons. Literature discusses attribute comparisons and for certain classes of connstraints practical solutions are developed to find maximally contained rewritings, when exists, for queries with all but inequality comparisons. We will develop constraints resolution and optimization modules for the rewriting algoritms in our context above. This extends our results in CoopIS 2005, where we considered constraints which are linear arithmetic expressions with equality. In another research theme in this proposal, we investigate modeling and processing sequence data, which do not have any structure. Emerging applications generate and use enormous amounts of such data. We focus more on biological sequences: DNA and proteins. The main issues are the required uge storage space and lengthy process of index construction. Further, efficient support for exact match and approximate searching is central to such applications. Hence a desired solution should be space efficient, scalable, with resonable index construction time and efficient various search tecniques. While string searching is not new, the enormous size of ever-growing biological sequences, and the variety and volume of queries to be supported pose new research challenges. There is a growing need for more sophisicated indexing structures and techniques. Based on our results in CIKM 2005, the expected contributions of this work include both theoretical and practical advances in the management of biological sequence data.
Concordia University - $16,000 Grant (2009-10) | Canada Spends