Results 1  10
of
270
Safe Database Queries with Arithmetic Relations
 Proc. 14th Australian Computer Science Conf
, 1991
"... We consider the theory of database queries on a relational data model that includes a set of fixed relations used to model arithmetic comparisons and operations. We describe how to extend several natural query languages such as firstorder logic, Datalog, and stratified Datalog to apply to databases ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We consider the theory of database queries on a relational data model that includes a set of fixed relations used to model arithmetic comparisons and operations. We describe how to extend several natural query languages such as firstorder logic, Datalog, and stratified Datalog to apply
Evaluating Queries with Generalized Path Expressions
 In Proceedings of the ACM SIGMOD International Conference on Management of Data
, 1996
"... In the past few years, query languages featuring generalized path expressions have been proposed. These languages allow the interrogation of both data and structure. They are powerful and essential for a number of applications. However, until now, their evaluation has relied on a rather naive and in ..."
Abstract

Cited by 73 (16 self)
 Add to MetaCart
In the past few years, query languages featuring generalized path expressions have been proposed. These languages allow the interrogation of both data and structure. They are powerful and essential for a number of applications. However, until now, their evaluation has relied on a rather naive
Fast Computation of Database Operations using Graphics Processors
"... We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunctive selections, aggregations, and semilinear queries, which are essential computational components of typical database, ..."
Abstract

Cited by 117 (12 self)
 Add to MetaCart
, for evaluating boolean predicate combinations and semilinear queries on attributes and executing database operations efficiently. Our algorithms take into account some of the limitations of the programming model of current GPUs and perform no data rearrangements. Our algorithms have been implemented on a
Accelerating Geometric Queries using the GPU
"... Figure 1: Geometric operations such as silhouette curve extraction and minimum distance/closest point computations between NURBS surfaces and complex CAD models accelerated using the GPU. We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using progra ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Figure 1: Geometric operations such as silhouette curve extraction and minimum distance/closest point computations between NURBS surfaces and complex CAD models accelerated using the GPU. We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using
Evaluating Signs of Determinants Using SinglePrecision Arithmetic
"... Most decisions in geometric algorithms are based on signs of determinants. For example, deciding if a point belongs to a given halfspace or a given ball reduces to evaluating the sign of a determinant. It is therefore crucial to have reliable answers to such tests and to produce robust algorithm ..."
Abstract
 Add to MetaCart
, the second approach is followed, the goal being to use as few bits as possible to evaluate signs of determinants. For dimensions n = 2 and n = 3, the algorithms proposed require respectively ` and ` + 1 bits arithmetic, and run in polynomial time in `: they perform in the worst case respectively O
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Fast multipleprecision evaluation of elementary functions
 Journal of the ACM
, 1976
"... XI3STnXC'r. Let f(x) be one of the usual elementary functions (exp, log, artan, sin, cosh, etc.), and let M(n) be the number of singleprecision operations reqmred to multiply nbit integers. It is shown that f(x) can be evaluated, with relative error 0(2'), m O(M(n)log (n)) operations as ..."
Abstract

Cited by 104 (7 self)
 Add to MetaCart
such as f, e, and e'. The algorithms depend on the theory of elhptic integrals, using the arithmeticgeometric mean iteration and ascending Landen transformations. Itsr wol~os Ar~o en~As~s: multipleprecision arithmetic, analytic complexity, arithmeticgeometric mean, computational complexity
Interval arithmetic yields efficient dynamic filters for computational geometry
 Disc. Appl. Maths
"... We discuss floatingpoint filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques can be used to speed up the exact evaluation of geometric predicates and describe an efficient implementation of interva ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
We discuss floatingpoint filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques can be used to speed up the exact evaluation of geometric predicates and describe an efficient implementation
On parametric empirical Bayes methods for comparing multiple groups using replicated gene expression profiles
"... DNA microarrays provide for unprecedented, largescale views of gene expression and, as
a result, have emerged as a fundamental measurement tool in the study of diverse biological
systems. Statistical questions abound; but many traditional data analytic approaches do
not apply, in large part becaus ..."
Abstract

Cited by 115 (10 self)
 Add to MetaCart
study. We also show how the posterior odds of dierential
expression in one version of the model is related to the ratio of the arithmetic mean to the
geometric mean of the two sample means. The methodology is used in a study of mammary
cancer in the rat, where four distinct patterns of expression
Automatic Classification of Web Queries Using Very Large Unlabeled Query Logs
"... Accurate topical classification of user queries allows for increased effectiveness and efficiency in generalpurpose Web search systems. Such classification becomes critical if the system must route queries to a subset of topicspecific and resourceconstrained backend databases. Successful query c ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
of information, such as online Web directories or the contents of retrieved pages, making it viable for use in demanding operational environments, such as largescale Web search services. We evaluate our approach using a large sample of queries from an operational Web search engine and show that our combined
Results 1  10
of
270