Neumüller, M. and Wilson, J. (2004) A model for querying semistructured data through the exploitation of regular sub-structures. In: Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), 2004-04-05 - 2004-04-07.
10.1.1.57.9734.pdf - Accepted Author Manuscript
Download (110kB) | Preview
Much research has been undertaken in order to speed up the processing of semistructured data in general and XML in particular. Many approaches for storage, compression, indexing and querying exist, e.g. [1, 2]. We do not present yet another such algorithm but a unifying model in which these algorithm can be understood. The key idea behind this research is the assumption, that most practical queries are based on a particular pattern of data that can be deduced from the query and which can then be captured using a regular structure amendable to efficient processing techniques.
|Item type:||Conference or Workshop Item (Paper)|
|Notes:||Requires Template change to Chapter in Book/Report/Conference proceeding › Conference contribution: Proceedings of the Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP'04)|
|Keywords:||xml, programming languages, data structures, semi-structured data, Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Strathprints Administrator|
|Date Deposited:||14 Feb 2007|
|Last modified:||02 Apr 2017 06:37|