365 search results - page 30 / 73 » Answering Non-Monotonic Queries in Relational Data Exchange |
184
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
81
Voted
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
104
Voted
WWW
2011
ACM
14 years 4 months ago
2011
ACM
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
67
Voted
AMW
2010
14 years 11 months ago
2010
Abstract. Inference control can guarantee confidentiality but is costly to implement. Access control can be implemented efficiently but cannot guarantee confidentiality. Hence, it ...