Sciweavers

1992 search results - page 65 / 399
» Implementing sorting in database systems
Sort
View
QSIC
2005
IEEE
14 years 3 months ago
Proving the Safety of SQL Queries
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
Stefan Brass, Christian Goldberg
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 11 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
SIGMOD
2004
ACM
110views Database» more  SIGMOD 2004»
14 years 10 months ago
Toward a Progress Indicator for Database Queries
Many modern software systems provide progress indicators for long-running tasks. These progress indicators make systems more user-friendly by helping the user quickly estimate how...
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Mi...
IPPS
1997
IEEE
14 years 1 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
CADE
2009
Springer
14 years 4 months ago
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...