Aarhus Universitets segl

English

Du er her: AU » Om AU » Organisation » Multi-Dimensional Path Queries

Om AU

Multi-Dimensional Path Queries

Publikation: Working paper/Preprint › Working paper › Forskning

Standard

Multi-Dimensional Path Queries. / Bækgaard, Lars.
1998.

Publikation: Working paper/Preprint › Working paper › Forskning

Harvard

Bækgaard, L 1998 'Multi-Dimensional Path Queries'.

APA

Bækgaard, L. (1998). Multi-Dimensional Path Queries.

CBE

Bækgaard L. 1998. Multi-Dimensional Path Queries.

MLA

Bækgaard, Lars Multi-Dimensional Path Queries. 1998., 16 s.

Vancouver

Bækgaard L. Multi-Dimensional Path Queries. 1998.

Author

Bækgaard, Lars. / Multi-Dimensional Path Queries. 1998.

Bibtex

@techreport{d985e550b23311dda645000ea68e967b,
title = "Multi-Dimensional Path Queries",
abstract = "We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path that connects a pair of paths. A path expression is a function that maps a set of path sets into a path set. Path sets can be joined, filtering conditions can restrict the set of qualifying paths, and aggregation functions can be applied to path elements. In particular, the aggregation function SET can be used to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments",
author = "Lars B{\ae}kgaard",
year = "1998",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Multi-Dimensional Path Queries

AU - Bækgaard, Lars

PY - 1998

Y1 - 1998

N2 - We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path that connects a pair of paths. A path expression is a function that maps a set of path sets into a path set. Path sets can be joined, filtering conditions can restrict the set of qualifying paths, and aggregation functions can be applied to path elements. In particular, the aggregation function SET can be used to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments

AB - We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path that connects a pair of paths. A path expression is a function that maps a set of path sets into a path set. Path sets can be joined, filtering conditions can restrict the set of qualifying paths, and aggregation functions can be applied to path elements. In particular, the aggregation function SET can be used to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments

M3 - Working paper

BT - Multi-Dimensional Path Queries

ER -