Which one is the most efficient - ODI or DIM?

Hi,
Which is the most efficient of ODI&DIM to use as a middleware between Relational DB and Hyperion Planning? Please do let me know the benifits of them?
Thanks,
Luv

Hello, thanks for your rapid answer.
I have a macBook Pro (15"), with a Intel 2,3Ghz Core I7. 4Go 1700 Mhz DDR3. NVIDIA GeForce GT 650M 512 Mo, and OS X 10.8.4.
I have the following ports: FireWire 800, Thunderbolt, USB 3 (x2), SDXC card slot, audio In and audio out (headphones).
I bought a Belkin Mini DisplayPort to HDTV Cable (https://discussions.apple.com/message/22742775?ac_cid=op123456#22742775)
I have an HD TV from LG 32LH3000, with 3 HDMI inputs. I regularly use one of these HDMI input to watch movies, stored on an HDD.
Thanks again for your help.

Similar Messages

  • How to go from Firewire 800 or Thunderbolt to HDMI? Which one is the most efficient?, How to go from Firewire 800 or Thunderbolt to HDMI? Which one is the most efficient?

    I have no HDMI port on my macbook, but only Thunderbolt and FireWire 800, and I need to connect to my digital TV that requires an HDMI port.

    Hello, thanks for your rapid answer.
    I have a macBook Pro (15"), with a Intel 2,3Ghz Core I7. 4Go 1700 Mhz DDR3. NVIDIA GeForce GT 650M 512 Mo, and OS X 10.8.4.
    I have the following ports: FireWire 800, Thunderbolt, USB 3 (x2), SDXC card slot, audio In and audio out (headphones).
    I bought a Belkin Mini DisplayPort to HDTV Cable (https://discussions.apple.com/message/22742775?ac_cid=op123456#22742775)
    I have an HD TV from LG 32LH3000, with 3 HDMI inputs. I regularly use one of these HDMI input to watch movies, stored on an HDD.
    Thanks again for your help.

  • Which compiler genrerates the most efficient code?

    Does anybody know which compiler genrates the most efficient code? Jikes or javac? Or are there others more powerfull? If anybody has any information please submit a link to some benchmark test. I have tried both compilers, and I think that Jikes is compiling clearly faster, but does that mean that it is sloppy or doesn't it mean anything.

    It's not so much the comiler but rather the jvm that is responsible for speed issues.
    Of course if the compiler generates crappy bytecodes it doesn't help. But finally the jvm does the optimizing and running...

  • HT1338 What is the best Anti-Virus to install on Mac OS X 10.6.8? Which one is the most effective?

    Dear all,
    I would like to get more references about which  antivirus program could be more powerful and effective to maintain the Mac OS X 10.6.8 secure.
    Many thanks in advance,

    Hello:
    NO anti-virus software is needed (or desirable) for a Mac running OS X.  There are NO viruses that affect a Mac running OS X - none.  You will hear that some malware exists, but that is preventable by avoiding strange sites or downloading from unknown sources.
    Barry

  • Which package is the most imortant among the peoplesoft packages?

    I want to be a PeopleSoft programmer, I understand SQR(I used to use it in Hyperion system), and I want to install a peoplesoft software in my laptop, what is the basic software I should install first? Since there are too many peoplesoft packages, I'm not sure which one is the most important and basic staff I should learn first? Is it PeopleSoft Enterprise Perfromance Management? Please advise, thanks!

    You should install the database platform and then install the PeopleTools system database. Then install the PeopleTools local client to get access to App Designer.
    As a starting point you should just learn the toolset and not worry about the specific applications. All of the modules are built using the toolset. You will need to setup a PIA environment before learning App Engine again this can occur without any specific modules.
    Once you know the toolset it depends on the modules you want to learn. Project Costing is a core module that is a good one to know as it is used by most applications.

  • Which transport protocol is most efficient in JMS adaptor and why..???

    Hi all,
    Which transport protocol is most efficient in JMS adaptor and why..???
    Also can anyone tell me how to check queues in the integration server and in the reciever side....???
    If any one explain it rather than providing any link...i will be delighted...
    Thanks....
    Biplab

    <i>Which transport protocol is most efficient in JMS adaptor and why..???</i>
    U have to select the JMS provider for the JMS adapter under Transport Protocol.
    The selection of JMS provider could be according to ur cost estimation.
    http://help.sap.com/saphelp_nw04/helpdata/en/c1/739c4186c2a409e10000000a155106/frameset.htm
    SONIQ MQ and IBM MQ series r widely used
    <i>Also can anyone tell me how to check queues in the integration server and in the reciever side....???</i>
    smq1 - outbound queues
    smq2 - inbound queues
    Regards,
    Prateek

  • The most efficient way to search a large String

    Hi All,
    2 Quick Questions
    QUESTION 1:
    I have about 50 String keywords -- I would like to use to search a big String object (between 300-3000 characters)
    Is the most efficient way to search it for my keywords like this ?
    if(myBigString.indexOf("string1")!=1 || myBigString.indexOf("string2")!=1 || myBigString.indexOf("string1")!=1 and so on for 50 strings.)
    System.out.println("it was found");
    QUESTION 2:
    Can someone help me out with a regular expression search of phone number in the format NNN-NNN-NNNN
    I would like it to return all instances of that pattern found on the page .
    I have done regular expressions, in javascript in vbscript but I have never done regular expressions in java.
    Thanks

    Answer 2:
    If you have the option of using Java 1.4, have a look at the new regular expressions library... whose package name I forget :-/ There have been articles published on it, both at JavaWorld and IBM's developerWorks.
    If you can't use Java 1.4, have a look at the jakarta regular expression projects, of which I think there are two (ORO and Perl-like, off the top of my head)
    http://jakarta.apache.org/
    Answer 1:
    If you have n search terms, and are searching through a string of length l (the haystack, as in looking for a needle in a haystack), then searching for each term in turn will take time O(n*l). In particular, it will take longer the more terms you add (in a linear fashion, assuming the haystack stays the same length)
    If this is sufficient, then do it! The simplest solution is (almost) always the easiest to maintain.
    An alternative is to create a finite state machine that defines the search terms (Or multiple parallel finite state machines would probably be easier). You can then loop over the haystack string a single time to find every search term at once. Such an algorithm will take O(n*k) time to construct the finite state information (given an average search term length of k), and then O(l) for the search. For a large number of search terms, or a very large search string, this method will be faster than the naive method.
    One example of a state-search for strings is the Boyer-Moore algorithm.
    http://www-igm.univ-mlv.fr/~lecroq/string/tunedbm.html
    Regards, and have fun,
    -Troy

  • What is the most efficient way of passing large amounts of data through several subVIs?

    I am acquiring data at a rate of once every 30mS. This data is sorted into clusters with relevant information being grouped together. These clusters are then added to a queue. I have a cluster of queue references to keep track of all the queues. I pass this cluster around to the various sub VIs where I dequeue the data. Is this the most efficient way of moving the data around? I could also use "Obtain Queue" and the queue name to create the reference whenever I need it.
    Or would it be more efficient to create one large cluster which I pass around? Then I can use unbundle by index to pick off the values I need. This large cluster can have all the values individually or it co
    uld be composed of the previously mentioned clusters (ie. a large cluster of clusters).

    > I am acquiring data at a rate of once every 30mS. This data is sorted
    > into clusters with relevant information being grouped together. These
    > clusters are then added to a queue. I have a cluster of queue
    > references to keep track of all the queues. I pass this cluster
    > around to the various sub VIs where I dequeue the data. Is this the
    > most efficient way of moving the data around? I could also use
    > "Obtain Queue" and the queue name to create the reference whenever I
    > need it.
    > Or would it be more efficient to create one large cluster which I pass
    > around? Then I can use unbundle by index to pick off the values I
    > need. This large cluster can have all the values individually or it
    > could be composed of the previously mentioned clusters (i
    e. a large
    > cluster of clusters).
    It sounds pretty good the way you have it. In general, you want to sort
    these into groups that make sense to you. Then if there is a
    performance problem, you can arrange them so that it is a bit better for
    the computer, but lets face it, our performance counts too. Anyway,
    this generally means a smallish number of groups with a reasonable
    number of references or objects in them. If you need to group them into
    one to pass somewhere, bundle the clusters together and unbundle them on
    the other side to minimize the connectors needed. Since the references
    are four bytes, you don't need to worry about the performance of moving
    these around anyway.
    Greg McKaskle

  • What is the most efficient way to turn an array of 16 bit unsigned integers into an ASCII string such that...?

    What is the most efficient way to turn a one dimensional array of 16 bit unsigned integers into an ASCII string such that the low byte of the integer is first, then the high byte, then two bytes of hex "00" (that is to say, two null characters in a row)?
    My method seems somewhat ad hoc. I take the number, split it, then interleave it with 2 arrays of 4095 bytes. Easy enough, but it depends on all of these files being exactly 16380 bytes, which theoretically they should be.
    The size of the array is known. However, if it were not, what would be the best method?
    (And yes, I am trying to read in a file format from another program)

    My method:
    Attachments:
    word_array_to_weird_string.vi ‏18 KB

  • How to determine which drive has the most recent backup?

    I have a few drives that contain backups of files. What would be the easiest way to figure out which of the drives has the most recent backup? When I sort by date, the folder shows one date, though the files inside show a different date? Is there a way to quickly check the drives to find which is the most recent?
    Thanks.

    the folder modification date isn't reliable, as is only tells of changed in the folder, but not in subfolders. there is no efficient way. I however highly suggest Time capsule, it is WAY easier and you can ask it not to sync the System data and/or applications, so it would prevent this hassle.
    You could try this: go to the first drive, type different letters, like a for instance, and see which file is the most recent document/folder.
    do the same thing on the other drives and compare.

  • PLEASE APPLE, GIVE US SYNCING VIA ITUNES BACK!!!!!! Why take away one of the most valuable features of iTunes???? Why take away our choice of syncing via the Cloud or locally with iTunes????

    DO NOT UPGRADE TO MAVERICK UNLESS YOU WANT TO BE DEPENDED ON APPLE’S CLOUD. It removes the ability to sync Calendar, Notepad, and Contacts between your apple devices. You then can only sync them via Apple’s Cloud. For those of you like me, that do not want to be depended on an external data base accessible via the Internet or Cel Phone (with data charges).
    Why do I not want to use the Cloud to sync and backup?
    1. I found I only have one device with me at a time or am sitting at a computer when I add to my calendar, make a note, or add/change a Contact. Syncing with iTunes while upgrading apps and doing a back up to two external hard drives worked great and met my needs.
    2. I use WiFi and pay for the minimum data plan with my Cel provider (AT&T). I do not want to pay higher monthly data fees.
    3. I do not like a central data base (that will be hacked someday) having the personal info I have in my Notes, Schedule, and Contacts.
    4. I like the security of my most important data being on my own hard drives and written off to Data DVD’s, not subject to even rare central system outages/failures.
    5. I do not like the prospect of becoming dependent on a Cloud in which the provider could decide at any time to either start selling information or charging monthly fees to recover the costs of providing the cloud.
    I am reluctant to go to the trouble to go back to 10.8 because Apple will eventual stop providing updates to 10.8 and 10.8 compatible applications.
    PLEASE APPLE, GIVE US SYNCING VIA ITUNES BACK!!!!!! Why take away one of the most valuable features of iTunes???? Why take away our choice of syncing via the Cloud or locally with iTunes????

    You will need to contact Apple through their feedfack channel. These are user to user forums, sorry.
    FEEDBACK    http://www.apple.com/feedback/macosx.html
    Pete

  • Hello, I have macbook pro 2008 10.5.8 and I want to upgrade to new soft, which one is the proper one for me Snow leopard or mountain Lion

    Hello, I have macbook pro, late 2008, OS X 10.5.8 and I want to upgrade to new soft, which one is the proper one for me Snow leopard or Mountain Lion, and what is the differences between those.
    What do you recommend at this time for me.
    Thanks a lot

    You can upgrade to Mountain Lion, but you have to upgrade to Snow Leopard first. Buy Snow Leopard > http://store.apple.com/us/product/MC573/mac-os-x-106-snow-leopard
    Then, make a backup, insert the DVD and upgrade. After upgrading, open Apple menu > Software Update and install the most recent version. Mac OS X 10.6.8 includes the App Store, so open it and purchase Mountain Lion. See if your programmes are compatible > http://www.roaringapps.com

  • I'm hoping to buy a ipad air or ipad mini 2 to read PDFs, which one is the best....???? (need a help)

    I'm hoping to buy a ipad air or ipad mini 2 to read PDFs, which one is the best....????
    (need a help)

    I agree with Ralph. It all depends on what you're comfortable reading on.
    Most retailers have demo devices, go to a store and play with them and see which one works best for you

  • PowerShell - what is the most efficient/fastest way to find an object in an arraylist

    Hi
    I Work with a lot of array lists in PowerShell when working as a sharepoint administrator. I first used arrays but found them slow and jumped over to array lists.
    Often i want to find a specific object in the array list, but the respons-time varies a lot. Does anyone have code for doing this the most efficient way?
    Hope for some answers:-)
    brgs
    Bjorn

    Often i want to find a specific object in the array list, but the respons-time varies a lot. Does anyone have code for doing this the most efficient way?
    As you decided to use an ArrayList, you must keep your collection sorted, and then use the method BinarySearch() to find the objects your looking for.
    Consider using a dictionary, and if your objects are string type, then a StringDictionary.
    You stil fail to understand that he slowness is no in the arraylist.  It is in the creating of the arraylist which is completely unnecessary.  Set up a SharePoint servefr and create a very large list and test..  You will see. An arraylist
    with 10000 items takes forever to create. A simple SharePoint search can be done in a few milliseconds.
    Once created the lookup in any collection is dependent on the structure of the key and the type of collection.  A string key can be slow if it is a long key.
    The same rules apply to general database searches against an index.
    The main point here is that SharePoint IS a database and searching it as a database is the fastesst method.
    Prove me wrong devil!    Submit!  Back to your cage! Fie on thee!
    ¯\_(ツ)_/¯
    You seem to be making a lot of assumptions about what he's doing with those arraylists that doesn't seem justified based on no more information than there is in the posted question.
    [string](0..33|%{[char][int](46+("686552495351636652556262185355647068516270555358646562655775 0645570").substring(($_*2),2))})-replace " "

  • What's the most efficient way to serve a file from a servlet?

    I have a servlet that does various different things depending on the needs. Sometimes it dynamically generates content, and sometimes all it does is send a file out, with no alteration.
    What is the most efficient way to just send a file?
    One option:
    OutputStream os = response.getOutputStream();
    InputStream is = new FileInputStream(...)
    (send all the bytes from is to os, the regular way using a buffer)Another option is to say:
    RequestDispatcher rd = response.getRequestDispatcher(fileName);
    rd.forward();Any other options? What's the prefered way of doing this?
    I know the rule of "don't optimize too early" but this is a situation where we need to get the maximum amount of files served with the hardware we have, and it's going to be a lot of static files, so efficiency is important.
    Thanks

    Ok, that's what I thought. It would be nice if there were a "response.sendStream(InputStream input)" method in the ServletResponse class. Even nicer would be a sendFile or sendChannel or something. This is probably a common usage and it's a place where the container has many opportunities for optimization. For example, it could call the operating systems send_file kernel call so the entire transfer would be done directly from the disk controller to the ether card (on systems that support that).
    For now I'll just do my own buffered copy.

Maybe you are looking for