Structured Parallel Computation in Structured Documents

Structured Parallel Computation in Structured Documents (1995)

Cached

Download Links

by D. B. Skillicorn

Venue:	Journal of Universal Computer Science
Citations:	6 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Structured Parallel Computation in Structured Documents	user correction - Legacy Corrections
AUTHOR NAME	D. B. Skillicorn	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computing and Information Science; Queen's University; Kingston	SVM HeaderParse 0.2
AUTHOR ADDR	Ontario K7L 3N6	SVM HeaderParse 0.1
ABSTRACT	Document archives contain large amounts of data to which sophisticated queries are applied. The size of archives and the complexity of evaluating queries makes the use of parallelism attractive. The use of semantically-based markup such as SGML makes it possible to represent documents and document archives as data types. We present a theory of trees and tree homomorphisms, modelling structured text archives and operations on them, from which it can be seen that: ffl many apparently-unrelated tree operations are homomorphisms; ffl homomorphisms can be described in a simple parameterised way that gives standard sequential and parallel implementations for them; ffl special classes of homomorphisms have parallel implementations of practical interest. In particular, we develop an implementation for path expression search, a novel powerful query facility for structured text, that takes time logarithmic in the text size. Keywords: structured text, categorical data type, software developme...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	Journal of Universal Computer Science	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	42--68	INFERENCE
VOLUME	3	INFERENCE
TECH	Technical Report 95-379	INFERENCE
CITATIONS	24 found	ParsCit 1.0