Sciweavers

1992 search results - page 239 / 399
» Implementing sorting in database systems
Sort
View
OOPSLA
1992
Springer
14 years 1 months ago
CACL: Efficient Fine-Grained Protection for Objects
CACL is a protection scheme for objects that offers a simple and flexible model of protection and has an efficient, software-only implementation. The model, based on Access Contro...
Joel E. Richardson, Peter M. Schwarz, Luis-Felipe ...
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 9 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 9 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
232views Database» more  SIGMOD 2006»
14 years 9 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 7 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou