Sciweavers

261 search results - page 12 / 53
» Event processing with an oracle database
Sort
View
GEOINFO
2003
15 years 1 months ago
Efficient Query Processing on the Relational Quadtree
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 existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ESWA
2008
101views more  ESWA 2008»
14 years 11 months ago
Discovering during-temporal patterns (DTPs) in large temporal databases
Abstract Large temporal Databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal pa...
Li Zhang, Guoqing Chen, Tom Brijs, Xing Zhang
DEBU
2008
131views more  DEBU 2008»
14 years 11 months ago
Testing Berkeley DB
Oracle Berkeley DB is a family of database engines that provide high performance, transactional data management on a wide variety of platforms. Berkeley DB products are available ...
Ashok Joshi, Charles Lamb, Carol Sandstrom
176
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 1 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
ASPLOS
1998
ACM
15 years 4 months ago
Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors
Database applications such as online transaction processing (OLTP) and decision support systems (DSS) constitute the largest and fastest-growing segment of the market for multipro...
Parthasarathy Ranganathan, Kourosh Gharachorloo, S...