Sciweavers

4850 search results - page 509 / 970
» Approximate Data Structures with Applications
Sort
View
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
16 years 1 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
16 years 1 months ago
Adaptive Execution of Stream Window Joins in a Limited Memory Environment
A sliding window join (SWJoin) is becoming an integral operation in every stream data management system. In some streaming applications the increasing volume of streamed data as w...
Fatima Farag, Moustafa A. Hammad
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 2 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 11 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
185
Voted
EWC
2002
90views more  EWC 2002»
15 years 7 months ago
An Efficient Adaptive Procedure for Three-Dimensional Fragmentation Simulations
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulation...
Anna Pandolfi, Michael Ortiz