The translation of queries from complex data models to simpler data models is a recurring theme in the construction of efficient data management systems. In this paper we propose a general framework to guide the translation from data models with nested types to a flat relational model (query flattening), and show how several instances of query flattening fit or do not fit in this pattern.
|Title of host publication||Proceedings of the VLDB 2005 PhD Workshop|
|Number of pages||4|
|Publication status||Published - Aug 2005|
- DB-XMLDB: XML DATABASES
- DB-PRJDODO: FLATTENING QUERIES OVER NESTED DATA TYPES