Sciweavers

511 search results - page 62 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
16 years 15 days ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire
155
Voted
P2P
2003
IEEE
110views Communications» more  P2P 2003»
15 years 11 months ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
SIGMOD
2004
ACM
198views Database» more  SIGMOD 2004»
16 years 6 months ago
Secure XML Querying with Security Views
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
Wenfei Fan, Chee Yong Chan, Minos N. Garofalakis
160
Voted
IPMI
2005
Springer
16 years 7 months ago
Approximating Anatomical Brain Connectivity with Diffusion Tensor MRI Using Kernel-Based Diffusion Simulations
We present a new technique for noninvasively tracing brain white matter fiber tracts using diffusion tensor magnetic resonance imaging (DT-MRI). This technique is based on performi...
Jun Zhang, Ning Kang, Stephen E. Rose
VLDB
2004
ACM
128views Database» more  VLDB 2004»
16 years 6 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...