Sciweavers

3000 search results - page 514 / 600
» Accessing an Information System by Chatting
Sort
View
VLDB
2009
ACM
208views Database» more  VLDB 2009»
16 years 6 months ago
A distributed spatial index for error-prone wireless data broadcast
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broad...
Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik L...
SIGMOD
2007
ACM
134views Database» more  SIGMOD 2007»
16 years 6 months ago
Updating a cracked database
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
16 years 6 months ago
Data delivery in a service-oriented world: the BEA aquaLogic data services platform
"Wow. I fell asleep listening to SOA music, and when I woke up, I couldn't remember where I'd put my data. Now what?" Has this happened to you? With the new pu...
Michael J. Carey
SIGMOD
2004
ACM
131views Database» more  SIGMOD 2004»
16 years 6 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...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 3 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan