3974 search results - page 25 / 795 » Metric Functional Dependencies |
PODS
2008
ACM
14 years 8 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
JASIS
2007
13 years 7 months ago
2007
We present an approach to enhancing information access through web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwi...
TCS
1998
13 years 7 months ago
1998
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
LPAR
2001
Springer
14 years 10 days ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...