Sciweavers

4955 search results - page 491 / 991
» Multiple Pattern Databases
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 5 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
EDBT
2008
ACM
172views Database» more  EDBT 2008»
16 years 4 months ago
Distributed privacy preserving k-means clustering with additive secret sharing
Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the curr...
Albert Levi, Erkay Savas, Mahir Can Doganay, Thoma...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 11 months ago
Efficient Private Record Linkage
— Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and...
Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmag...
ER
2007
Springer
184views Database» more  ER 2007»
15 years 11 months ago
Collection Type Constructors in Entity-Relationship Modeling
Abstract. Collections play an important part in everyday life. Therefore, conceptual data models should support collection types to make data modeling as natural as possible for it...
Sven Hartmann, Sebastian Link
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
15 years 11 months ago
Privacy Preserving Clustering on Horizontally Partitioned Data
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications. The power of data mining tools to extract hidden information that can...
Ali Inan, Yücel Saygin, Erkay Savas, Ay&ccedi...