A model for querying semistructured data through the exploitation of regular sub-structures

M. Neumüller, J. Wilson

Research output: Contribution to conferencePaper

177 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages117-120
Number of pages3
Publication statusPublished - 2004
EventPostgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04) - Hertfordshire, UK
Duration: 5 Apr 20047 Apr 2004

Conference

ConferencePostgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04)
CityHertfordshire, UK
Period5/04/047/04/04

Keywords

  • xml
  • programming languages
  • data structures
  • semi-structured data

Fingerprint Dive into the research topics of 'A model for querying semistructured data through the exploitation of regular sub-structures'. Together they form a unique fingerprint.

Cite this