Sciweavers

2386 search results - page 320 / 478
» Database Security 2000
Sort
View
SSDBM
2000
IEEE
86views Database» more  SSDBM 2000»
15 years 7 months ago
Serving Datacube Tuples from Main Memory
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
Kenneth A. Ross, Kazi A. Zaman
PODS
2000
ACM
137views Database» more  PODS 2000»
15 years 7 months ago
Query Containment for Data Integration Systems
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
Todd D. Millstein, Alon Y. Levy, Marc Friedman
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 7 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
SIGMOD
2000
ACM
137views Database» more  SIGMOD 2000»
15 years 7 months ago
LOF: Identifying Density-Based Local Outliers
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common pattern...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 7 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi