Sciweavers

293 search results - page 9 / 59
» Efficiently Querying Relational Databases Using OWL and SWRL
Sort
View
PODS
2006
ACM
121views Database» more  PODS 2006»
15 years 9 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
87
Voted
DKE
2006
109views more  DKE 2006»
14 years 9 months ago
Xandy: A scalable change detection technique for ordered XML documents using relational databases
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
Erwin Leonardi, Sourav S. Bhowmick
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 3 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
156
Voted
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
15 years 11 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova