Sciweavers

2783 search results - page 488 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 1 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
16 years 1 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
Lukasz Golab, M. Tamer Özsu
PODS
2001
ACM
148views Database» more  PODS 2001»
16 years 1 months ago
On the Design and Quantification of Privacy Preserving Data Mining Algorithms
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
Dakshi Agrawal, Charu C. Aggarwal
PODS
2002
ACM
98views Database» more  PODS 2002»
16 years 1 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 1 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...