Sciweavers

SIGMOD
2004
ACM
131views Database» more  SIGMOD 2004»
14 years 11 months ago
Order-Preserving Encryption for Numeric Data
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikan...
SIGMOD
2004
ACM
119views Database» more  SIGMOD 2004»
14 years 11 months ago
Lazy Query Evaluation for Active XML
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, I...
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
14 years 11 months ago
Adaptive Ordering of Pipelined Stream Filters
We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications...
Shivnath Babu, Rajeev Motwani, Kamesh Munagala, It...
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 11 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 11 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 11 months ago
Information-Theoretic Tools for Mining Database Structure from Large Data Sets
Periklis Andritsos, Renée J. Miller, Panayi...
SIGMOD
2004
ACM
133views Database» more  SIGMOD 2004»
14 years 11 months ago
Robust key establishment in sensor networks
Secure communication guaranteeing reliability, authenticity, and privacy in sensor networks with active adversaries is a challenging research problem since asymmetric key cryptosy...
Yongge Wang
SIGMOD
2004
ACM
101views Database» more  SIGMOD 2004»
14 years 11 months ago
State-of-the-art in privacy preserving data mining
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for ana...
Vassilios S. Verykios, Elisa Bertino, Igor Nai Fov...
SIGMOD
2004
ACM
115views Database» more  SIGMOD 2004»
14 years 11 months ago
Ontologies and Semantics for Seamless Connectivity
The goal of having networks of seamlessly connected people, software agents and IT systems remains elusive. Early integration efforts focused on connectivity at the physical and s...
Michael Uschold, Michael Grüninger
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 11 months ago
A secure hierarchical model for sensor network
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...
Malik Ayed Tubaishat, Jian Yin, Biswajit Panja, Sa...