Sciweavers

164 search results - page 23 / 33
» A Relational Algebra for Functional Logic Deductive Database...
Sort
View
DEBU
2008
118views more  DEBU 2008»
14 years 10 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
DEXAW
2007
IEEE
128views Database» more  DEXAW 2007»
15 years 1 months ago
Sharing Data on the Grid using Ontologies and distributed SPARQL Queries
The vision of the Semantic Web is to make Web content machine-readable. To describe data, the Resource Description Framework has been extended with a schema-level and description ...
Andreas Langegger, Martin Blöchl, Wolfram W&o...
CADE
2005
Springer
15 years 10 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
ISMIS
2005
Springer
15 years 3 months ago
A Data Model Based on Paraconsistent Intuitionistic Fuzzy Relations
Abstract. Paraconsistent intuitionistic fuzzy set is an extension of intuitionistic fuzzy set or interval-valued fuzzy set. It relaxes the requirement that t + f ≤ 1, where t is ...
Haibin Wang, Rajshekhar Sunderraman
PODS
2006
ACM
104views Database» more  PODS 2006»
15 years 10 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei