Sponsored Content
Special Forums UNIX and Linux Applications Oracle Updates (RSS) Building a Hybrid Data Warehouse Model Post 302182281 by Linux Bot on Sunday 6th of April 2008 05:10:15 AM
Old 04-06-2008
Building a Hybrid Data Warehouse Model

As suggested by this reference implementation, in some cases blending the relational and dimensional models may be the right approach to data warehouse design.

More...
 

3 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Hybrid CD-ROMs

Hello, Is there any way to create a hybrid CD-ROM on either a Windows or Solaris server to be able to mastered with a Windows mastering software like Roxio. Thanks, Mike (1 Reply)
Discussion started by: bubba112557
1 Replies

2. Virtualization and Cloud Computing

Data Warehouse evolving towards CEP?

vincent Tue, 25 Mar 2008 03:15:31 +0000 Whilst at DAMA last week I managed to miss the Teradata talk on “active data warehouses“. Luckily James Taylor blogged comprehensively on the talk, and although it seems Teradata declined to make the presentation available to attendees, I’m guessing it was... (0 Replies)
Discussion started by: Linux Bot
0 Replies

3. Programming

Building app. to send data to website

Hi. I plan to build an application which takes text data from a user. It then sends this to a website, login required. The business case being this site contains many text fields, mostly redundant to user. My application would only prompt user for necessary text. What language, methods... (4 Replies)
Discussion started by: cic
4 Replies
ANLDP(1)						      General Commands Manual							  ANLDP(1)

NAME
anldp - implementation of Davis-Putnam propositional satisfiability procedure SYNOPSIS
anldp [options] < input-file > output-file DESCRIPTION
This manual page documents briefly the anldp command. anldp is an implementation of a Davis-Putnam procedure for the propositional satisfiability problem. anldp exposes the procedure used by mace2(1) to determine satisfiability. anldp can also take statements in first-order logic with equality and a domain size n then search for models of size n. The first-order model-searching code transforms the statements into set of propositional clauses such that the first- order statements have a model of size n if and only if the propositional clauses are satisfiable. The propositional set is then given to the Davis-Putnam code; any propositional models that are found can be translated to models of the first-order statements. The first-order model-searching program accepts statements only in a flattened relational clause form without function symbols. OPTIONS
-s Perform subsumption. (Subsumption is always performed during unit preprocessing.) -p Print models as they are found. -m n Stop when the nth model is found. -t n Stop after n seconds. -k n Allocate at most n kbytes for storage of clauses. -x n Quasigroup experiment n. -B file Backup assignments to a file. -b n Backup assignments every n seconds. -R file Restore assignments from a file. The file typically contains just the last line of a backup file. Other input, in particular the clauses, must be given exactly as in the original search. -n n This option is used for first-order model searches. The parameter n specifies the domain size, and its presence tells the program to read first-order flattened relational input clauses instead of propositional clauses. SEE ALSO
formed(1), mace2(1), otter(1). Full documentation for anldp is found in /usr/share/doc/mace2/anldp.{html,ps.gz}. AUTHOR
anldp ws written by William McCune <otter@mcs.anl.gov> This manual page was written by Peter Collingbourne <pcc03@doc.ic.ac.uk>, for the Debian project (but may be used by others). November 5, 2006 ANLDP(1)
All times are GMT -4. The time now is 04:55 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy