Sciweavers

995 search results - page 47 / 199
» Optimization of Complex Nested Queries in Relational Databas...
Sort
View
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 7 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
CIKM
2009
Springer
15 years 5 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
141
Voted
VLDB
2010
ACM
190views Database» more  VLDB 2010»
15 years 8 days ago
Continuous authentication on relational streams
According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authentic...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
87
Voted
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 2 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
CDB
2004
Springer
169views Database» more  CDB 2004»
15 years 7 months ago
Semantic Optimization of Preference Queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). We present here a nu...
Jan Chomicki