Sciweavers

964 search results - page 30 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
SIGMOD
2004
ACM
131views Database» more  SIGMOD 2004»
16 years 4 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...
BTW
2007
Springer
136views Database» more  BTW 2007»
15 years 10 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
AIPS
2008
15 years 6 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
APWEB
2010
Springer
15 years 7 months ago
Multiple Continuous Queries Optimization for Processing RFID Streaming Data
This paper investigates the problem of processing multiple continuous queries over RFID streaming data in RFID middleware. RFID middleware collects and filters RFID sensing data wh...
Haipeng Zhang, Wooseok Ryu, Yongxu Piao, Bonghee H...
PDIS
1996
IEEE
15 years 8 months ago
Capabilities-Based Query Rewriting in Mediator Systems
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
Yannis Papakonstantinou, Ashish Gupta, Laura M. Ha...