Sciweavers

203 search results - page 30 / 41
» Unifying the Processing of XML Streams and Relational Data S...
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 9 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
DMSN
2010
ACM
13 years 6 months ago
Facilitating fine grained data provenance using temporal data model
E-science applications use fine grained data provenance to maintain the reproducibility of scientific results, i.e., for each processed data tuple, the source data used to proce...
Mohammad Rezwanul Huq, Andreas Wombacher, Peter M....
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 4 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 8 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
PREMI
2007
Springer
14 years 1 months ago
Discovery of Process Models from Data and Domain Knowledge: A Rough-Granular Approach
The rapid expansion of the Internet has resulted not only in the ever-growing amount of data stored therein, but also in the burgeoning complexity of the concepts and phenomena per...
Andrzej Skowron