— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Abstract. An important goal of security in information systems is confidentiality. A confidentiality policy specifies which users should be forbidden to acquire what kind of inform...
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
Abstract. The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-...