Sciweavers

1890 search results - page 18 / 378
» Querying Big Data by Accessing Small Data
Sort
View
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 2 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 11 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
DPD
2002
168views more  DPD 2002»
14 years 10 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
VLDB
1998
ACM
134views Database» more  VLDB 1998»
15 years 2 months ago
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The under...
Peter Muth, Patrick E. O'Neil, Achim Pick, Gerhard...
ICDE
1999
IEEE
91views Database» more  ICDE 1999»
16 years 1 days ago
Real-Time Data Access Control on B-Tree Index Structures
This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-...
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam