Sciweavers

223 search results - page 2 / 45
» Expressive and Efficient Peer-to-Peer Queries
Sort
View
ISMIS
2005
Springer
13 years 11 months ago
A Query Expression and Processing Technique for an XML Search Engine
Abstract. One of the virtues of XML is that it allows complex structures to be easily expressed. This allows XML to be used as an intermediate, neutral, and standard form for repre...
Wol-Young Lee, Hwan-Seung Yong
ESWS
2009
Springer
13 years 3 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 6 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
PODS
2006
ACM
121views Database» more  PODS 2006»
14 years 5 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
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 5 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch