Sciweavers

2662 search results - page 411 / 533
» Data Compression Support in Databases
Sort
View
ISCI
2007
99views more  ISCI 2007»
15 years 6 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
16 years 7 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 7 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
16 years 7 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
GIS
2006
ACM
16 years 7 months ago
Modeling and querying uncertain spatial information for situational awareness applications
Situational awareness (SA) applications monitor the real world and the entities therein to support tasks such as rapid decision-making, reasoning, and analysis. Raw input about un...
Dmitri V. Kalashnikov, Yiming Ma, Sharad Mehrotra,...