Sciweavers

2070 search results - page 169 / 414
» Querying Communities in Relational Databases
Sort
View
FOCS
1998
IEEE
15 years 3 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
15 years 4 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
15 years 5 months ago
Secure Mediation of Join Queries by Processing Ciphertexts
In a secure mediated information system, confidentiality is one of the main concerns when transmitting data from datasources to clients via a mediator. We present three approache...
Joachim Biskup, Christian Tsatedem, Lena Wiese
GPCE
2007
Springer
15 years 5 months ago
Simple and safe SQL queries with c++ templates
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
Joseph Gil, Keren Lenz
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
15 years 11 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman