Sciweavers

20878 search results - page 453 / 4176
» Database
Sort
View
ICDE
2009
IEEE
164views Database» more  ICDE 2009»
16 years 8 months ago
Efficient and Robust Database Support for Data-Intensive Applications in Dynamic Environments
Requirements from new types of applications call for new database system solutions. Computational science applications performing distributed computations on Grid networks with req...
Jon Olav Hauglid, Kjetil Nørvåg, Norv...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 8 months ago
Leveraging COUNT Information in Sampling Hidden Databases
A large number of online databases are hidden behind form-like interfaces which allow users to execute search queries by specifying selection conditions in the interface. Most of t...
Arjun Dasgupta, Nan Zhang, Gautam Das
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
16 years 8 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
ICDE
2001
IEEE
120views Database» more  ICDE 2001»
16 years 8 months ago
A Split Operator for Now-Relative Bitemporal Databases
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal...
Mikkel Agesen, Michael H. Böhlen, Lasse Pouls...
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 8 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke