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

M. Neumüller; J. Wilson

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

M. Neumüller, J. Wilson

Computer And Information Sciences

Research output: Contribution to conference › Paper › peer-review

351 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 language	English
Pages	117-120
Number of pages	3
Publication status	Published - 2004
Event	Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04) - Hertfordshire, UK Duration: 5 Apr 2004 → 7 Apr 2004

Conference

Conference	Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04)
City	Hertfordshire, UK
Period	5/04/04 → 7/04/04

Keywords

xml
programming languages
data structures
semi-structured data

Access to Document

10Accepted author manuscript, 107 KB

Cite this

@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",

}

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

T2 - Postgraduate Research Conference in Electronics, Photonics, Communications and Software (PREP 04)

Y2 - 5 April 2004 through 7 April 2004

ER -

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

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this