Implementation diff SD vs MM

Can anybody tell me the main difference while implementing approach of SD and MM in SAP BW?
Due points will be assigned.
Thanks in advance.
Regards
Niranjan

Hi,
With respect to BW there is not much of a difference except for the tables the data from where they are extracted.
Both are logistics data sources.So extraction process remains same with slight difference in inventory data loading.
Hope this helps
Assign points if useful
Regards,
venkat

Similar Messages

During the implementation in 2nd phase - BBP Document

Hi Friends,
During the implementation diff. modules are tobe implemented. Each module has 1 consultant i.e., FI, MM, SD, CO consultants. here my question is.....
Each consultant will be prepare AS-IS & TO-BE documents for their respective modules i.e.,
- FI Consultant - 1 AS-IS & TO-BE
- CO               - 1 do
- MM              - 1 do
- SD               - 1 do
these 4 bbp's are mixed and finalized and finally 1 bbp gets ready for further phases. is it correct, pl suggest me?
What is the role of each consultant in AS-IS & TO-BE(BBP) in the above example?
it would greatful help me and sure will assign points
Thanks
Edited by: Anita on Jan 24, 2008 6:12 AM
Edited by: Anita on Jan 24, 2008 6:12 AM

Dear Anita,
Yes u r right that Each consultant will be prepare AS-IS & TO-BE documents for their respective modules but these BBP's are not mixed up.
The rules of each consultant in phase 2 i e Business Blue Prints is to created bbp's or say Document which is going to configure in the SAP system along with core users.
AS - IS means what futures client's are using in the Legacy System
TO- BE mean what futures we are giving to client according to thier Legacy System
Hope u will Undersatnd.
Regards,
Javeed

Diffie-Hellman question

Can any body give me any example for implementing Diffie-Hellman protocol. I don't want to use the standard API, Because I just want to generate a 128 bit session key, I don't want to use such a big prim number (1024bit long).
Thank you

Can any body give me any example for implementing Diffie-Hellman protocol. I don't want to use the standard API, Because I just want to generate a 128 bit session key, I don't want to use such a big prim number (1024bit long).
Thank you

Diffie-Hellman algorithm hexadecimal

Hello,
I've made DH algoritm (link) but I need it to calculate in hex, can someone please show me how to tweek my code for that?
Attachments:
DH_algorithm_HEX.vi ‏14 KB

HEX is a representation (in Base 16) of numeric (usually integer!!) data. Your code shows Dbl (64-bit floats), which is not an "exact" numeric representation, so is unlikely to implement Diffie-Hillman. I notice you use the remainder operator which is well-defined for integer representations, but whose meaning is unclear (to me) for floats.
You should only need to use Hex to turn an input representation into an internal numeric form for computations, and to transform the output into a final representation.
Rethink what you are doing.
Bob Schor

Substitution strings in chart sql query

Hi Guys,
I am creating line charts and bar charts based on a query in HTML DB 1.5. I am using substitution strings in the query. Though I can use substitution strings in the line chart, I cannot do it in the bar chart. I am using almost the same sql query in both line and bar charts.
The sql query in line chart is
SELECT null, TO_CHAR(t1.extract_date, 'W-MON-YYYY') extractdate,
MIN_OF_AVERAGES(AVG(&P40_METRICS.),:P40_REGION_LIST,:P40_SUBREGION_LIST,NULL,:P40_METRICS,'ind') orgid
FROM ind t1,geography t2
WHERE t1.country_id = t2.country_id(+)
AND t2.region_name like
DECODE(:P40_REGION_LIST,'ALL REGIONS','%',:P40_REGION_LIST)
AND t2.subregion_name like
NVL(:P40_SUBREGION_LIST,'%')
GROUP BY TO_CHAR(extract_date, 'W-MON-YYYY')
order by to_date(extractdate,'DD-MON-YY')
The sql query in bar chart is
SELECT null, TO_CHAR(t1.extract_date, 'W-MON-YYYY') extractdate,AVG(&P40_METRICS.) orgid
FROM ind t1,geography t2
WHERE t1.country_id = t2.country_id(+)
AND t2.region_name like
DECODE(:P40_REGION_LIST,'ALL REGIONS','%',:P40_REGION_LIST)
AND t2.subregion_name like
NVL(:P40_SUBREGION_LIST,'%')
GROUP BY TO_CHAR(extract_date, 'W-MON-YYYY')
order by to_date(extractdate,'DD-MON-YY')
The min_of_averages function in the line chart query is some function I am calling. Even if I cut-paste the line chart query in the bar chart I get the error.
The substitution string which is giving the problem is "&P40_METRICS."
The error I am getting is
Query cannot be parsed, please check the syntax of your query. (ORA-00909: invalid number of arguments)
The only difference I see is that line chart query is inside a series and bar chart is not, does this make a difference??? Or is it because I am using the substitution string in choosing the column??? Please help!!!!
Thanks,
Swaroop

Swaroop,
You might be using an HTML bar chart and an SVG line chart, I can't tell, but their implementations differ. You won't be able to use a substitution string to replace a column name in the query in the situation you found, you'd have to figure out a way to construct the query string before it gets executed and I'm not sure the chart pages will let you do that.
Scott

Forms10g+JRE: minimize IE window after logon

Dear professionals,
is there anyway to programmatically minimize internet explorer (or firefox) window after user logon to application (except manually, of course :) )? We use JRE instead Jinitiator and property separate_window=true. Since users sometimes accidentally close opened IE windows, so they close application - i would like to minimize such possibility.
Thanks in advance,
Adnan

Basically there are the
htmlBeforeFormand
htmlAfterFormParameters in the formsweb.cfg where you can add additional html and also JavaScript. Just search on google how to minimize a window via JavaScript and put it in the htmlAfterForm
This will minimize the Browser window when loading your forms appliction. If you want to perform javascript on certain events (e.g. in a WHEN-BUTTON-PRESSED Trigger) you can do this with
web.show_documentjust search the forum here on JavaScript and take a look. I'm sure you'll find a starting point. Of course if you are having troubles or something is not clear to you do not hesitate to ask :)
cheers
P.S.: As JavaScript implementations differ between browsers I can guarantee you headaches; what workes in IExplorer won't work in Firefox and vice versa; if you are having troubles with this please add full browser versions as well as this definitely matters in this case.

BAdi vs. User Exit

Hi,
I was exploring the world of BAdi's and its use. I went thru its documentation on help.sap.com.
But I still could not understand completely its advantage over customer exits. I mean why should I opt for BAdi over Customer exit?
Regards,
Vikrant.

Hi,
Hi
BAdi & Customer-Exit
Though there a different enhancement technique, BAdi has following distinct features
-Uses Object oriented approach
-Two parts - Definition and its Implementation - definition can either be SAP provided or user may also create it
-no longer assumes a two-system infrastructure (SAP and customers)
-allows multiple levels of software development (by SAP, partners, and customers, and as country versions, industry solutions, and the like)
There is not much difference between a user exit and a BADI from a functional stand point. Both of them give us options write custom code that will fire in between the standard code. However, the way these have been implemented differ.
One is implemented using function modules / includes (user exits) and the other one using classes and methods (BADI's).
The best way to find out which user exit to use will be look at the parameters that are accessible and see if they contain the data that you are looking for. You can always put a break point and see if they are firing at the point where you require them.
Cheers,
SImha
Mark all the helpful answers..

FICO for Oil & Gas

I am looking at a job offer from an Oil & Gas company and was wondering if AP & AR implementations differ greatly for them from other sectors? What can I expect to be different from AP & Ar perspective? Thank you.

Not in AP/AR . Some lingo will be different and payment terms and dunning process vary.

PROXY. What optimisations are there?

We have a fairly big installation of proxies and masters which I am testing at the moment. Using SLAMD.
On a simple LDAP Auth test, I am seeing results that look like the following:
LDAP client -> Proxy -> Master. 600ms+ when handling only 125 auths/sec.
LDAP client -> Master (direct) 50ms when handling 250 auths/sec.
The proxy is the vanilla proxy install. I intuitively feel that the proxy is posing a performance bottleneck, but I cannot locate enough documentation to enlighten myself any more than this...
Anyone know of any proxy optimisations documented anywhere that can improve these type of performance numbers? Our masters are highly tuned, but there's no available information (so far) on how to tune the proxies... if it is possible....

Hi,
Could you please give LDAP proxy version number? Are u using 6.0 or 5.2 ?
Implementation differ between 5.2 and 6.0, and perf optimisations are very different.
Thanks
-Sylvain

Where to put the sql

Hi,
When I develop a Java software which gets data from the user (for example a Web page) and use them for performing and put the result into the database, according to you is it almost always smarter calling an Oracle stored procedure or a package making the task or can it be usefull to put the logics-sql inside the Java code? For me it's always better to develop a strored procedure to be called, but I'd like to listen to your experience.
Thanks!

If the Java code is to run against a variety of different database products, then it is limited to the lowest common denominator between these products - the basic SQL language.
And unfortunately, such code will use the various database products non-optimally. SQL language implementations differ. Analytical SQL functions available in one product will be different or even non-existent in another.
But in this case, the Java code has little choice - and need to use bare bones SQL.
Usually this is only a problem for ISVs that are developing commercial client products. For most others, we have a single database product as the strategic product for the selected IT architecture.
So in this case it makes sense to use and leverage all the features of that database products. Enabling the Java code to optimally use the database. Enable the database to perform and scale.
In the case of Oracle, that typically means not having Java developers code SQL at all. Not because they are SQL/Oracle idiots (which can be argued). But because of providing a formal and abstract data interface allows far greater flexibility, maintainability and usability.
It enables you to to deal with SQL and SQL related performance inside this interface, without having to touch and recompile a single byte of Java client code.
It enables you to deal with database structure changes via this interface, without having to touch and recompile a single byte of Java client code.
So it makes a LOT of sense to create and use such an interface - not just for Java clients, but all clients. Allowing all clients to share the same interface and be subject to the same validation and business rules in a coherent and consistent fashion.
In Oracle, this interface will be written using PL/SQL packages - and will typically return ref cursors to the clients.

Deque problems

When I run my Dequetester program, I get this error anytime I run my addLast, removeLast, or getLast methods in the DequeTester:
Exception in thread "main" java.lang.NullPointerException
at LinkedDeque.addLast(LinkedDeque.java:67) <<-----------------------
at DequeTester.main(DequeTester.java:63)
At the arrow it changes to .removeLast or .getLast depending on which method I tried to call. I guess I coded them wrong. Can someone help?
Here's my DequeTester
import java.util.Scanner;
import java.util.LinkedList;
public class DequeTester {
    static Scanner in = new Scanner(System.in);
    // main(String[]) method
    // purpose: creates a deque of Students and calls the other methods
    public static void main(String[] args) {
        // create an empty deque of Students
        LinkedDeque<Student> roster = new LinkedDeque<Student>();
        System.out.print("Do you want to perform a deque operation(yes/no)?:");
        String choice = in.next();
        while (choice.equals("yes"))
            System.out.println("Which operation would you like to do(add/get/remove)?:");
            String answer = in.next();
            System.out.println("Where would you like to place it(first/last)?:");
            String location = in.next();
            if (answer.equals("add"))
                if (location.equals("first"))
                    System.out.println("Enter student's first name:");
                    String firstName = in.next();
                    System.out.println("Enter student's last name:");
                    String lastName = in.next();
                    System.out.println("Enter student's credits:");
                    int Credits = in.nextInt();
                    System.out.println("Enter student's gpa:");
                    double GPA = in.nextDouble();
                    Student obj = new Student(firstName, lastName, Credits, GPA);
                    roster.addFirst(obj);
                if (location.equals("last"))
                    System.out.println("Enter student's first name:");
                    String firstName = in.next();
                    System.out.println("Enter student's last name:");
                    String lastName = in.next();
                    System.out.println("Enter student's credits:");
                    int Credits = in.nextInt();
                    System.out.println("Enter student's gpa:");
                    double GPA = in.nextDouble();
                    Student obj = new Student(firstName, lastName, Credits, GPA);
                    roster.addLast(obj);
            if (answer.equals("get"))
                if (location.equals("first"))
                    System.out.println(roster.getFirst ());
                if (location.equals("last"))
                    System.out.println(roster.getLast ());
            if (answer.equals("remove"))
                if (location.equals("first"))
                    System.out.println(roster.removeFirst ());
                if (location.equals("last"))
                    System.out.println(roster.removeLast ());
        System.out.print ("\nSize of the deque ");
        System.out.println(roster.getSize());
        System.out.println("\nWould you like to perform another deque operation(yes/no)?:");
        choice = in.next();
        System.out.println(roster);
        System.out.print ("\nSize of the deque ");
        System.out.println(roster.getSize());
    }Here's my LinkedDeque code:
import java.util.LinkedList;
public class LinkedDeque<E> implements Deque<E> {
    // first points to the first item in the deque
    private ListNode<E> first;
    // last points to the last item in the deque
    private ListNode<E> last;
    // size holds the number of items in the deque
    private int size;
    // LinkedDeque() - default constructor
    // purpose: initializes an empty deque
    public LinkedDeque() {
        first = null;
        last = null;
        size = 0;
    // getSize()
    // purpose: returns size of deque
    public int getSize() {
        return size;
    public boolean isEmpty() {
     if (size==0)
       return true;
     else
       return false;
    public E getFirst() {
        E result=first.getItem();
        return result;
    public E getLast() {
        E result=last.getItem();
        return result;
    public void addFirst(E element) {
        ListNode<E> node=new ListNode<E>(element);
        if (isEmpty()) {
            first=node;
        else {
            first.setNext(node);
            first=node; }
        size++;
    public void addLast(E element) {
        ListNode<E> node=new ListNode<E>(element);
        if(isEmpty()){
            last=node;
        else {
            last.setNext(node);
            last=node;
        size++;
    public E removeFirst() {
        size--;
        E result=first.getItem();
        first=first.getNext();
        return result;
    public E removeLast() {
         size--;
         E result=last.getItem();
         last=last.getNext();
         return result;
}

What happens when you use the built in LinkedList Deque? How does your implementation differ? Perhaps this will indicate what you did wrong.
The obvious question would be, why are you trying to replace a working collection with one which doesn't work.

Extending Linksys with Airport Router

Hi, have a Linksys WRT300N and customer bought an Airport Extreme - what is the best way to incorporate this into the network and still use the same IP range given out by the Linksys?
Also, as one moves from one zone to the stronger zone with 2 or 3 wireless access points, does the computer change it's affilation, or will the user need to do this?

Set the airport to "Create a Wireless Network" on the Airport tab and to "
Connect using Ethernet" using DHCP on the Internet tab. Wire the Airport to a LAN port of your WRT. That should do it.
If you want a wireless roaming network you have to configure identical wireless settings on the WRT and the Airport. You must use the same network name (SSID) and the same wireless security settings.
To avoid interference you should use different channels on both, though. But I am not sure how 802.11n handles the channel assignments. I don't have 11n here. Maybe it is best to leave it on automatic.
How a wireless client roams depends on the wireless card and driver. Generally you have no control over it. The client will roam automatically but implementations differ with some implementations being very bad resulting in disconnects during roaming.

Directory equiv. to FileDialog class?

I want to select directories. The only other option I could think of is to model the drive paths as JTrees and the nodes as AbstractPaths...the problem with this is I can't work out how to initialise the JTree with the drives available on my computer without hard coding them which obviously isn't a very flexible solution! Or perhaps would this be a very long winded way of achieving what I want?

Thanks for your reply, I will look into that JFileChoser class. As I had a bit of spare time this afternoon I decided to try and program what I wanted anyway, found the listRoots() method and produced this;
public class DirectoryListing extends JPanel {
private JTree directoryTree;
//testing...
private DefaultMutableTreeNode selectedNode;
public DirectoryListing() {
    loadDrives();
    directoryTree.setRootVisible(false);
    directoryTree.setToggleClickCount(1);
    directoryTree.addTreeSelectionListener(new MyTreeListener());
    directoryTree.setCellRenderer(new MyCellRenderer());
    directoryTree.setShowsRootHandles(true);
    JScrollPane treeSP = new JScrollPane();
    treeSP.getViewport().add(directoryTree);
    setLayout(new BorderLayout());
    add(treeSP, BorderLayout.CENTER);
public void loadDrives(){
    DefaultMutableTreeNode root = new DefaultMutableTreeNode();
    File[] availableDrives = File.listRoots();
    for (int i = 0; i < availableDrives.length; i++) {
      DefaultMutableTreeNode aNode = new DefaultMutableTreeNode(availableDrives);
root.insert(aNode, root.getChildCount());
directoryLookAhead(aNode);
directoryTree = new JTree(root);
public class MyTreeListener implements TreeSelectionListener {
public void valueChanged(TreeSelectionEvent e) {
selectedNode = (DefaultMutableTreeNode) directoryTree.getLastSelectedPathComponent();
if (selectedNode != null) {
subDirectoryLookAhead(selectedNode);
public class MyCellRenderer extends JLabel implements TreeCellRenderer {
public MyCellRenderer() {
setOpaque(false);
public Component getTreeCellRendererComponent(JTree tree,
Object value,
boolean sel,
boolean expanded,
boolean leaf,
int row,
boolean hasFocus) {
File aFile = (File) ( ( (DefaultMutableTreeNode) value).getUserObject());
String text = aFile.getName();
if(text.length() == 0){
text = aFile.getPath();
setText(text);
if (sel || expanded) {
setIcon(UIManager.getIcon("Tree.openIcon"));
}else {
setIcon(UIManager.getIcon("Tree.closedIcon"));
if (sel) {
setForeground(Color.green);
}else {
setForeground(Color.black);
return this;
public void subDirectoryLookAhead(DefaultMutableTreeNode aNode) {
directoryLookAhead(aNode);
for (Enumeration n = aNode.children() ; n.hasMoreElements() ;) {
DefaultMutableTreeNode subNode = (DefaultMutableTreeNode) n.nextElement();
directoryLookAhead(subNode);
( (DefaultTreeModel) directoryTree.getModel()).reload();
public void directoryLookAhead(DefaultMutableTreeNode aNode){
File aFile = (File) aNode.getUserObject();
File[] directoryListing = aFile.listFiles();
if (directoryListing != null && directoryListing.length > 0 && aNode.getChildCount() == 0) {
for (int i = 0; i < directoryListing.length; i++) {
if (directoryListing[i].isDirectory()) {
aNode.insert(new DefaultMutableTreeNode(directoryListing[i]),aNode.getChildCount());
And, surprising it works, I must be getting better at this lark but alas, there's a few problems;
-You can only select leafs on the JTree - not nodes themselves - this is no good.
-If you invoke the JTree method 'setToggleClickCount' to anything other than 1, the tree keeps collapsing when reloading.
-Regardless of the setToggleClickCount if you double click on a node it also collapses the tree.
-I can't work how to get the hieracy lines to show.
-Finally, when you expand a node such as the windows directory (i.e. one with lots of sub directories) there's a little delay (i.e. its not as efficient as a standard implementation would be, when you run a file selector in any 'properly programed' program :) How does the 'proper' implementation differ from what I've tried to do here?
thanks for looking!

Which PA infotypes differ in comparison to US for a global implementation?

HI experts,
WE are working on a global template. I just wanted to know which PA infotypes differ in comparison to US for a global implementation?
Thanks,
Rashmi

Please check the table V_T582L.
You will see the infotypes for various country specific.

Wht is the diff enhancement and implementation project

hi all,
what is the diff between enhancement project and
implementation project, and as we use ASAP methedology for
implementaion, what is the project scenario for enhancment
projects.
what is P2 in support projects, what r the types of tickets we have in support projects.
thnx in advance

hi,
enhancement project - > already existing system. we are adding some new functionalities into that.
scenario -> addition of a new market.
adding the pension scheme to existing pat roll system
Implementation proj - > from the scratch we r developing a new system.
going to do the whloe buissines in SAP.
rgds
anver
if hlped mark points
scenario - >

Implementation diff SD vs MM

Similar Messages

Maybe you are looking for