2956 search results - page 286 / 592 » Databases and Higher Types |
250
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
168
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
132
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
134
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
154
click to vote
ITICSE
2004
ACM
15 years 9 months ago
2004
ACM
SQL (Structured Query Language) is one of the essential topics in foundation databases courses in higher education. Due to its apparent simple syntax, learning to use the full pow...