Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
ACM Computing Surveys (CSUR)
Integrating an object-oriented programming system with a database system
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Using integrity constraints to provide intensional answers to relational queries
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
On Representing Indefinite and Maybe Information in Relational Databases
Proceedings of the Fourth International Conference on Data Engineering
An Efficient Semantic Query Optimization Algorithm
Proceedings of the Seventh International Conference on Data Engineering
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Tracking join and self-join sizes in limited storage
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Join synopses for approximate query answering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Approximate query processing model for mobile computing
Information organization and databases
Informix under CONTROL: Online Query Processing
Data Mining and Knowledge Discovery
Scaling Access to Heterogeneous Data Sources with DISCO
IEEE Transactions on Knowledge and Data Engineering
Similarity-Based Queries for Information Retrieval
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
Aqua: A Fast Decision Support Systems Using Approximate Query Answers
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Histogram-Based Approximation of Set-Valued Query-Answers
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
ICICLES: Self-Tuning Samples for Approximate Query Answering
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Approximate Query Processing: Taming the TeraBytes
Proceedings of the 27th International Conference on Very Large Data Bases
Partial Evaluations in a Set-Theoretic Query Language for the WWW
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Cooperative query processing via knowledge abstraction and query relaxation
Advanced topics in database research vol. 1
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Specification and Management of QoS in Real-Time Databases Supporting Imprecise Computations
IEEE Transactions on Computers
Partial read from peer-to-peer databases
Computer Communications
LACO: A location-aware cooperative query system for securely personalized services
Expert Systems with Applications: An International Journal
Browsing databases with constraint hierarchies
Electronic Commerce Research
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Driver input selection for main-memory multi-way joins
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.01 |
APPROXIMATE, a query processor that makes approximate answers available if part of the database is unavailable, or if there is not enough time to produce an exact answer, is described. The processor implements approximate query processing, and the accuracy of the approximate result produced improves monotonically with the amount of data retrieved to produce the result. The monotone query processing algorithm of APPROXIMATE works within a standard relational algebra framework. APPROXIMATE maintains semantic information for approximate query processing at an underlying level, and can be implemented on a relational database system with little change to the relational architecture. It is shown how APPROXIMATE is implemented to make effective use of the semantic support. The additional overhead required by APPROXIMATE is described.