Sciweavers

415 search results - page 56 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
AAI
2007
132views more  AAI 2007»
13 years 7 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
VLDB
1998
ACM
138views Database» more  VLDB 1998»
13 years 11 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
HAPTICS
2002
IEEE
14 years 9 days ago
Computationally Efficient Techniques for Real Time Surgical Simulation with Force Feedback
In this paper, we present computationally efficient algorithms for the real time simulation of minimally invasive surgical (MIS) procedures. To develop a surgical simulator for tr...
Jung Kim, Suvranu De, Mandayam A. Srinivasan
SIGUCCS
2004
ACM
14 years 23 days ago
Web-based technologies: reaching their ultimate potential on restricted budgets
Academic institutions’ dependence on web-based technologies to improve efficiency in class offerings, academic records, and office documentation is increasing at a rapid pace. T...
Salvador Báez-Franceschi, Karen Le, Diana V...
FGCS
2000
81views more  FGCS 2000»
13 years 7 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch