Sciweavers

6004 search results - page 375 / 1201
» Parallelizing query optimization
Sort
View
DLOG
2007
15 years 9 months ago
Exploiting Conjunctive Queries in Description Logic Programs
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
BNCOD
2004
85views Database» more  BNCOD 2004»
15 years 8 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 11 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
198
Voted
STACS
1995
Springer
15 years 10 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
CGO
2007
IEEE
15 years 10 months ago
Shadow Profiling: Hiding Instrumentation Costs with Parallelism
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling profilers incur negligible overhead, but the information they collect is consequen...
Tipp Moseley, Alex Shye, Vijay Janapa Reddi, Dirk ...