Sciweavers

10 search results - page 2 / 2
» Containment of Partially Specified Tree-Pattern Queries
Sort
View
VLDB
2002
ACM
114views Database» more  VLDB 2002»
13 years 4 months ago
Tree Pattern Aggregation for Scalable XML Data Dissemination
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
Chee Yong Chan, Wenfei Fan, Pascal Felber, Minos N...
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 4 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein
PODS
2010
ACM
228views Database» more  PODS 2010»
13 years 6 months ago
Capturing missing tuples and missing values
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...
Wenfei Fan, Floris Geerts
CSE
2009
IEEE
13 years 9 months ago
An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing
A user stores his personal files in a cloud, and retrieves them wherever and whenever he wants. For the sake of protecting the user data privacy and the user queries privacy, a use...
Qin Liu, Guojun Wang, Jie Wu
VLDB
1989
ACM
98views Database» more  VLDB 1989»
13 years 9 months ago
A Family of Incomplete Relational Database Models
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
Adegbemiga Ola, Gultekin Özsoyoglu