The theory developed in this thesis provides a method to improve the efficiency of querying nested data. The roots of this research lie in the tension between data model expressiveness and performance. Obviously, more expressive data models are more convenient for application programmers. For many non-traditional database applications, such as GIS, IR and multimedia applications, a more expressive data model is desirable. Building an expressive system with good performance turns out to be a hard problem.
|Award date||2 Jun 2006|
|Place of Publication||Enschede|
|Publication status||Published - 2 Jun 2006|
- DB-PRJDODO: FLATTENING QUERIES OVER NESTED DATA TYPES
- DB-XMLDB: XML DATABASES
- DB-PRJMOA: MAGNUM OBJECT ALGEBRA
- DB-OODB: OBJECT-ORIENTED DATABASES