Sciweavers

67 search results - page 1 / 14
» Database Query Processing Using Finite Cursor Machines
Sort
View
ICDT
2007
ACM
143views Database» more  ICDT 2007»
13 years 11 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
DEBS
2009
ACM
13 years 11 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
PODS
2007
ACM
108views Database» more  PODS 2007»
14 years 4 months ago
Machine models and lower bounds for query processing
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
Nicole Schweikardt
ADBIS
1998
Springer
97views Database» more  ADBIS 1998»
13 years 9 months ago
Using Queries with Multi-Directional Functions for Numerical Database Applications
Object-oriented database management systems are often motivated by their support for new emerging application areas such as computer-aided design and analysis systems. The object-o...
Staffan Flodin, Kjell Orsborn, Tore Risch
ICGI
2004
Springer
13 years 10 months ago
Learning Stochastic Finite Automata
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
Colin de la Higuera, José Oncina