Elkada, Jimmy (2001) A graph-oriented query language for semi-structured data : theoretical and practical analysis. Other thesis, Concordia University.
![[img]](http://spectrum.library.concordia.ca/style/images/fileicons/application_pdf.png)
| PDF 4Mb |
Abstract
This study examines the theoretical foundations and the practical aspects of the graph-oriented query language for the semi-structured data (SSD) proposed in [KNS99]. SSD is a data model that is designed for heterogeneous data sources. It allows for information integration and information sharing over the Internet. Several query languages for the SSD model have been proposed but none has been standardized yet. This paper analyzes the graph-oriented query language proposal, and suggests ways in which it can be further improved to fit the SSD model.
| Divisions: | Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering |
|---|---|
| Item Type: | Thesis (Other) |
| Authors: | Elkada, Jimmy |
| Pagination: | 55, [47] leaves : ill. ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | Major reports (M.Comp.Sc.) |
| Program: | Computer Science and Software Engineering |
| Date: | 2001 |
| Thesis Supervisor(s): | Grahne, Gosta |
| ID Code: | 1402 |
| Deposited By: | Concordia University Libraries |
| Deposited On: | 27 Aug 2009 13:19 |
| Last Modified: | 08 Dec 2010 10:20 |
| Related URLs: |
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
