| 1. |
- André-Jönsson, Henrik, 1968-
(författare)
-
Indexing strategies for time series data
- 2002
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Traditionally, databases have stored textual data and have been used to store administrative information. The computers used. and more specifically the storage available, have been neither large enough nor fast enough to allow databases to be used for more technical applications. In recent years these two bottlenecks have started to di sappear and there is an increasing interest in using databases to store non-textual data like sensor measurements or other types of process-related data. In a database a sequence of sensor measurements can be represented as a time series. The database can then be queried to find, for instance, subsequences, extrema points, or the points in time at which the time series had a specific value. To make this search efficient, indexing methods are required. Finding appropriate indexing methods is the focus of this thesis.There are two major problems with existing time series indexing strategies: the size of the index structures and the lack of general indexing strategies that are application independent. These problems have been thoroughly researched and solved in the case of text indexing files. We have examined the extent to which text indexing methods can be used for indexing time series.A method for transforming time series into text sequences has been investigated. An investigation was then made on how text indexing methods can be applied on these text sequences. We have examined two well known text indexing methods: the signature files and the B-tree. A study has been made on how these methods can be modified so that they can be used to index time series. We have also developed two new index structures, the signature tree and paged trie structures. For each index structure we have constructed cost and size models. resulting in comparisons between the different approaches.Our tests indicate that the indexing method we have developed. together with the B-tree structure. produces good results. It is possible to search for and find sub-sequences of very large time series efficiently.The thesis also discusses what future issues will have to be investigated for these techniques to be usable in a control system relying on time-series indexing to identify control modes.
|
|
| 2. |
|
|
| 3. |
- Andrejev, Andrej, et al.
(författare)
-
Scientific data as RDF with arrays : Tight integration of SciSPARQL queries into MATLAB
- 2014
-
Ingår i: Proc. ISWC 2014 Posters & Demonstrations Track. - : RWTH Aachen University. ; , s. 221-224
-
Konferensbidrag (refereegranskat)abstract
- We present an integrated solution for storing and querying scientific data and metadata, using MATLAB envi ronment as client front-end and our prototype DBMS on the server. We use RDF for experiment metadata, and numeric arrays for the rest. Our extension of SPARQL supports array operations and extensibility with foreign functions.
|
|
| 4. |
|
|
| 5. |
- Andrejev, Andrej, 1980-
(författare)
-
Semantic Web Queries over Scientific Data
- 2016
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Semantic Web and Linked Open Data provide a potential platform for interoperability of scientific data, offering a flexible model for providing machine-readable and queryable metadata. However, RDF and SPARQL gained limited adoption within the scientific community, mainly due to the lack of support for managing massive numeric data, along with certain other important features – such as extensibility with user-defined functions, query modularity, and integration with existing environments and workflows.We present the design, implementation and evaluation of Scientific SPARQL – a language for querying data and metadata combined, represented using the RDF graph model extended with numeric multidimensional arrays as node values – RDF with Arrays. The techniques used to store RDF with Arrays in a scalable way and process Scientific SPARQL queries and updates are implemented in our prototype software – Scientific SPARQL Database Manager, SSDM, and its integrations with data storage systems and computational frameworks. This includes scalable storage solutions for numeric multidimensional arrays and an efficient implementation of array operations. The arrays can be physically stored in a variety of external storage systems, including files, relational databases, and specialized array data stores, using our Array Storage Extensibility Interface. Whenever possible SSDM accumulates array operations and accesses array contents in a lazy fashion.In scientific applications numeric computations are often used for filtering or post-processing the retrieved data, which can be expressed in a functional way. Scientific SPARQL allows expressing common query sub-tasks with functions defined as parameterized queries. This becomes especially useful along with functional language abstractions such as lexical closures and second-order functions, e.g. array mappers.Existing computational libraries can be interfaced and invoked from Scientific SPARQL queries as foreign functions. Cost estimates and alternative evaluation directions may be specified, aiding the construction of better execution plans. Costly array processing, e.g. filtering and aggregation, is thus preformed on the server, saving the amount of communication. Furthermore, common supported operations are delegated to the array storage back-ends, according to their capabilities. Both expressivity and performance of Scientific SPARQL are evaluated on a real-world example, and further performance tests are run using our mini-benchmark for array queries.
|
|
| 6. |
- Andrejev, Andrej, et al.
(författare)
-
Spatio-Temporal Gridded Data Processing on the Semantic Web
- 2015
-
Ingår i: 2015 IEEE International Conference On Data Science And Data Intensive Systems. - 9781509002146 ; , s. 38-45
-
Konferensbidrag (refereegranskat)abstract
- Multidimensional array data, such as remote-sensing imagery and timeseries, climate model simulations, telescope observations, and medical images, contribute massively to virtually all science and engineering domains, and hence play a key role in 'Big Data' challenges. Pure array storage management and analytics is relatively well understood today. However, arrays in practice never come alone, but are accompanied by metadata, including domain, range, provenance information, etc. The structure of this metadata is far less regular than arrays or tables, and may be incomplete or different from one array instance to another. Particularly in the field of the Semantic Web such integrated representations must convey a sufficiently complete and reasonable semantics for machine-machine communication. We show how the Resource Description Framework (RDF), the Semantic Web graph model for metadata, can be leveraged for such data/metadata integration specifically for representing spatio-temporal grid data. Based on the notion of a coverage as established by the Open Geospatial Consortium (OGC) we present a hybrid data store where efficiently represented arrays are incorporated as nodes into RDF graphs and connected to their metadata. We have extended the Semantic Web query language SPARQL to incorporate array query semantics and other functionality making it suitable for processing of large numeric arrays, including geo coverages.
|
|
| 7. |
- Andrejev, Andrej, et al.
(författare)
-
Strategies for array data retrieval from a relational back-end based on access patterns
- 2020
-
Ingår i: Computing. - : Springer Science and Business Media LLC. - 0010-485X .- 1436-5057. ; 102:5, s. 1139-1158
-
Tidskriftsartikel (refereegranskat)abstract
- Multidimensional numeric arrays are often serialized to binary formats for efficient storage and processing. These representations can be stored as binary objects in existing relational database management systems. To minimize data transfer overhead when arrays are large and only parts of arrays are accessed, it is favorable to split these arrays into separately stored chunks. We process queries expressed in an extended graph query language SPARQL, treating arrays as node values and having syntax for specifying array projection, element and range selection operations as part of a query. When a query selects parts of one or more arrays, only the relevant chunks of each array should be retrieved from the relational database. The retrieval is made by automatically generated SQL queries. We evaluate different strategies for partitioning the array content, and for generating the SQL queries that retrieve it on demand. For this purpose, we present a mini-benchmark, featuring a number of typical array access patterns. We draw some actionable conclusions from the performance numbers.
|
|
| 8. |
|
|
| 9. |
- Badiozamany, Sobhan, 1983-, et al.
(författare)
-
Framework for real-time clustering over sliding windows
- 2016
-
Ingår i: Proc. 28th International Conference on Scientific and Statistical Database Management. - New York : ACM Press. - 9781450342155 ; , s. 1-13
-
Konferensbidrag (refereegranskat)
|
|
| 10. |
|
|
