Searching for authors named "Yannis Sismanis" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Maintaining Implicated Statistics in Constrained Environments ∗
- …Aggregated information regarding implicated entities is critical for online applications like network management, traffic characterization or identifying patters of resource consumption. Recently there has been a flurry of research for online aggregation on streams (like quantiles, hot items, hierar…
- Add To MetaCart
-
N.: The polynomial complexity of fully materialized coalesced cubes
- …The data cube operator encapsulates all possible groupings of a data set and has proved to be an invaluable tool in analyzing vast amounts of data. However its apparent exponential complexity has significantly limited its applicability to low dimensional datasets. Recently the idea of the coalesced …
- Cited by 1 (0 self) – Add To MetaCart
-
Shared Index Scans For Data Warehouses
- …. In this paper we propose a new \transcurrent execution model" (TEM) for concurrent user queries against tree indexes. Our model exploits intra-parallelism of the index scan and dynamically decomposes each query into a set of disjoint \query patches". TEM integrates the ideas of prefetching and…
- Cited by 1 (0 self) – Add To MetaCart
-
Multidimensional content exploration
- …Content Management Systems (CMS) store enterprise data such as insurance claims, insurance policies, legal documents, patent applications, or archival data like in the case of digital libraries. Search over content allows for information retrieval, but does not provide users with great insight into …
- Cited by 1 (1 self) – Add To MetaCart
-
Discovering Topical Structures of Databases
- …The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solutions addressed mining for keys and foreign keys, but paid little attention to more high-level structures of databases. I…
- Add To MetaCart
-
Dwarf: Shrinking the PetaCube
- …Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalescing their store. Prefix redundancy is high on dense areas of cubes but suffix redundancy is significantly higher for spa…
- Cited by 25 (5 self) – Add To MetaCart
-
Hierarchical Dwarfs for the Rollup Cube
- …The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compressed and clustered structure for creating, storing and indexing data cubes. Dwarf is a complete architecture that supports q…
- Cited by 8 (1 self) – Add To MetaCart
-
Shared Index Scans For Data Warehouses
- …Tree based indexing structures like B-trees, B + -trees, Bitmap indexes and R-trees have become essential for getting good performance when accessing vast datasets. However, most database research seems to ignore the behavior that the disk hardware observes during index scans. In this paper we a…
- Add To MetaCart
-
Gordian: efficient and scalable discovery of composite keys
- …Identification of (composite) key attributes is of fundamental importance for many different data management tasks such as data modeling, data integration, anomaly detection, query formulation, query optimization, and indexing. However, information about keys is often missing or incomplete in many r…
- Cited by 3 (0 self) – Add To MetaCart
-
Efficient Dissemination of Aggregate Data over the Wireless Web
- …A23CB$0D;!- ! 3# NO0;&P RS &TA23U! P ! 28799-40800 TA23U! P %/ % 0
- Cited by 4 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
