Name
Abstract | ||
|---|---|---|
A common phenomenon of time-qualified data are temporal repetitions, i.e., the association of multiple time values with the same data. In order to deal with finite and infinite temporal repetitions in databases we must use compact representations. There have been many compact representations proposed, however, not all of them are equally efficient for query evaluation. In order to show it, we define a class of simple queries on compact representations. We compare a query evaluation time on our proposed multi-granular compact representation GSequences with a query evaluation time on single-granular compact representation PSets, based on periodical sets. We show experimentally how the performance of query evaluation can benefit from the compactness of a representation and from a special structure of GSequences. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11733836_10 | DASFAA |
Keywords | Field | DocType |
query evaluation,simple query,single-granular compact representation psets,proposed multi-granular compact representation,query evaluation time,compact representation,multiple time value,time-qualified data,infinite temporal repetition,temporal repetition | Data mining,Database query,Computer science,Compact space,Temporal database,Database | Conference |
Volume | ISSN | ISBN |
3882 | 0302-9743 | 3-540-33337-1 |
Citations | PageRank | References |
3 | 0.43 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Romans Kasperovics | 1 | 9 | 2.59 |
| Michael Böhlen | 2 | 189 | 11.73 |