Sciweavers

1768 search results - page 335 / 354
» Mining Very Large Databases
Sort
View
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
14 years 11 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
ICDE
2002
IEEE
112views Database» more  ICDE 2002»
14 years 11 months ago
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
WWW
2009
ACM
14 years 10 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 10 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
VLDB
2009
ACM
147views Database» more  VLDB 2009»
14 years 10 months ago
Privacy-preserving indexing of documents on the network
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) ...
Mayank Bawa, Rakesh Agrawal, Roberto J. Bayardo Jr...