Sciweavers

11573 search results - page 330 / 2315
» Designing Relational Databases
Sort
View
VLDB
1991
ACM
179views Database» more  VLDB 1991»
15 years 10 months ago
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
Object-oriented data models are receiving wide attention since they provide expressive ionmechanismsto model naturally and directly both structural and behavioral aspectsof comple...
Antonio Albano, Giorgio Ghelli, Renzo Orsini
SIGMOD
2008
ACM
65views Database» more  SIGMOD 2008»
16 years 6 months ago
Generating targeted queries for database testing
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...
Chaitanya Mishra, Nick Koudas, Calisto Zuzarte
ICDT
1990
ACM
110views Database» more  ICDT 1990»
15 years 10 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
ICPR
2002
IEEE
16 years 7 months ago
The Performance Analysis of a Chi-square Similarity Measure for Topic Related Clustering of Noisy Transcripts
The goal of the paper is to present a novel Chi-square similarity measure and assess its performance through comparison with well-known similarity measures such as Cosine, Dice, a...
Oktay Ibrahimov, Ishwar K. Sethi, Nevenka Dimitrov...
185
Voted
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy