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

M. Neumüller, J. Wilson

Research output: Contribution to conferencePaper

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.

Conference

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

Fingerprint

Processing
XML

Keywords

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

Cite this

Neumüller, M., & Wilson, J. (2004). A model for querying semistructured data through the exploitation of regular sub-structures. 117-120. Paper presented at Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), Hertfordshire, UK, .
Neumüller, M. ; Wilson, J. / A model for querying semistructured data through the exploitation of regular sub-structures. Paper presented at Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), Hertfordshire, UK, .3 p.
@conference{bc916edc141749cabd0a20187d047b70,
title = "A model for querying semistructured data through the exploitation of regular sub-structures",
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.",
keywords = "xml, programming languages, data structures, semi-structured data",
author = "M. Neum{\"u}ller and J. Wilson",
note = "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); Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04) ; Conference date: 05-04-2004 Through 07-04-2004",
year = "2004",
language = "English",
pages = "117--120",

}

Neumüller, M & Wilson, J 2004, 'A model for querying semistructured data through the exploitation of regular sub-structures' Paper presented at Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), Hertfordshire, UK, 5/04/04 - 7/04/04, pp. 117-120.

A model for querying semistructured data through the exploitation of regular sub-structures. / Neumüller, M.; Wilson, J.

2004. 117-120 Paper presented at Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), Hertfordshire, UK, .

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Neumüller, M.

AU - Wilson, J.

N1 - 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)

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - xml

KW - programming languages

KW - data structures

KW - semi-structured data

UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.9734

M3 - Paper

SP - 117

EP - 120

ER -

Neumüller M, Wilson J. A model for querying semistructured data through the exploitation of regular sub-structures. 2004. Paper presented at Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04), Hertfordshire, UK, .