Sciweavers

7640 search results - page 1218 / 1528
» Event Database Processing
Sort
View
FQAS
1998
Springer
118views Database» more  FQAS 1998»
15 years 11 months ago
Partial Answers for Unavailable Data Sources
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...
Philippe Bonnet, Anthony Tomasic
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 10 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 10 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
VLDB
1994
ACM
121views Database» more  VLDB 1994»
15 years 10 months ago
An Overview of Repository Technology
A repository is a shareddatabaseof information aboutengineeredartifacts.Wedefinea repository manager to be a databaseapplication that suPports checkout/checkin, version and config...
Philip A. Bernstein, Umeshwar Dayal
CIKM
2006
Springer
15 years 10 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
« Prev « First page 1218 / 1528 Last » Next »