470 search results - page 80 / 94 » Privacy-Preserving Queries over Relational Databases |
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose th...
MDM
2004
Springer
14 years 1 months ago
2004
Springer
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
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...