Sciweavers

813 search results - page 36 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
DEXAW
1997
IEEE
125views Database» more  DEXAW 1997»
14 years 19 days ago
Can we Rely on SQL?
It is important for any data language that it enables many people to derive correct information from a databases in a simple, effective way with predictable performance. In an ana...
J. H. ter Bekke
JMLC
1997
Springer
14 years 17 days ago
An Object-Oriented Database Programming Environment for Oberon
Abstract. We describe a system designed to provide database programming support for Oberon programmers. The system is based on a generic object-oriented data model which supports r...
Jacques Supcik, Moira C. Norrie
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
APLAS
2011
ACM
12 years 8 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
14 years 19 days ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz