Sciweavers

750 search results - page 135 / 150
» Aggregates in Possibilistic Databases
Sort
View
VLDB
1997
ACM
78views Database» more  VLDB 1997»
14 years 1 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 1 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
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 1 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
DBPL
1995
Springer
106views Database» more  DBPL 1995»
14 years 1 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
IJCSA
2008
237views more  IJCSA 2008»
13 years 9 months ago
Development of A SOLAP Patrimony Management Application System: Fez Medina as a Case Study
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
I. Salam, M. El Mohajir, A. Taleb, B. El Mohajir