261 search results - page 23 / 53 » Event processing with an oracle database |
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
DASFAA
2004
IEEE
14 years 11 days ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
ER
2007
Springer
14 years 2 months ago
2007
Springer
There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and a...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
IR
2010
13 years 5 months ago
2010
The ability to correctly classify sentences that describe events is an important task for many natural language applications such as Question Answering (QA) and Text Summarisation....