Sciweavers

470 search results - page 51 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 9 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
14 years 7 days ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
BTW
2003
Springer
92views Database» more  BTW 2003»
14 years 1 months ago
A Logical, Transparent Model for Querying Linked XML Documents
Abstract:The W3C XML Linking Language (XLink) provides a powerful means for interlinking XML documents all over the world. While the effects when browsing through linked XML docume...
Wolfgang May, Dimitrio Malheiro
ICDT
1999
ACM
72views Database» more  ICDT 1999»
14 years 28 days ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
ALT
2000
Springer
14 years 1 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata