Sciweavers

12194 search results - page 2032 / 2439
» Numberings Optimal for Learning
Sort
View
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 7 months ago
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
Nesime Tatbul, Stanley B. Zdonik, Ugur Çeti...
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
16 years 7 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 7 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 7 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
« Prev « First page 2032 / 2439 Last » Next »