More cost efficient way??

Any suggestions as to a more efficient way to write the following statement?
SELECT 'P22-RANGE-1 ', PSU, CD.PARID, CD.LASTUPDATEDATE,
PR.VEHICLEID P01,
PR.OCCNUMBER P02,
PR.PERSONTYPEID P03,
NM.STRIKEVEHICLEID P22
FROM NASS.PARDATA PAR,
GES.CRASHDATA CD,
GES.PERSON PR,
GES.NONMOTORIST NM
WHERE PAR.PARID=CD.PARID AND
CD.PARID=PR.PARID AND
PR.PARID=NM.PARID (+) AND
PR.VEHICLEID=NM.VEHICLEID (+) AND
PR.OCCUPANTID=NM.OCCUPANTID (+) AND
((PR.PERSONTYPEID IN (26706,26707,26708,26709,26710) AND
(NM.STRIKEVEHICLEID<1 OR
NM.STRIKEVEHICLEID IS NULL)) OR
(PR.PERSONTYPEID IN (26704,26705,26711) AND
NM.STRIKEVEHICLEID>0))
ORDER BY 1,2,3,4,5,6;

I would try this
SELECT 'P22-RANGE-1 ', PSU, CD.PARID, CD.LASTUPDATEDATE,
PR.VEHICLEID P01,
PR.OCCNUMBER P02,
PR.PERSONTYPEID P03,
NM.STRIKEVEHICLEID P22
FROM NASS.PARDATA PAR,
GES.CRASHDATA CD,
GES.PERSON PR,
GES.NONMOTORIST NM
WHERE PAR.PARID=CD.PARID AND
CD.PARID=PR.PARID AND
PR.PARID=NM.PARID (+) AND
PR.VEHICLEID=NM.VEHICLEID (+) AND
PR.OCCUPANTID=NM.OCCUPANTID (+) AND
PR.PERSONTYPEID BETWEEN 26706 AND 26710 AND
NVL(NM.STRIKEVEHICLEID,0)<1
UNION ALL
SELECT 'P22-RANGE-1 ', PSU, CD.PARID, CD.LASTUPDATEDATE,
PR.VEHICLEID P01,
PR.OCCNUMBER P02,
PR.PERSONTYPEID P03,
NM.STRIKEVEHICLEID P22
FROM NASS.PARDATA PAR,
GES.CRASHDATA CD,
GES.PERSON PR,
GES.NONMOTORIST NM
WHERE PAR.PARID=CD.PARID AND
CD.PARID=PR.PARID AND
PR.PARID=NM.PARID (+) AND
PR.VEHICLEID=NM.VEHICLEID (+) AND
PR.OCCUPANTID=NM.OCCUPANTID (+) AND
PR.PERSONTYPEID BETWEEN 26704 AND 26705 AND
NM.STRIKEVEHICLEID>0
UNION ALL
SELECT 'P22-RANGE-1 ', PSU, CD.PARID, CD.LASTUPDATEDATE,
PR.VEHICLEID P01,
PR.OCCNUMBER P02,
PR.PERSONTYPEID P03,
NM.STRIKEVEHICLEID P22
FROM NASS.PARDATA PAR,
GES.CRASHDATA CD,
GES.PERSON PR,
GES.NONMOTORIST NM
WHERE PAR.PARID=CD.PARID AND
CD.PARID=PR.PARID AND
PR.PARID=NM.PARID (+) AND
PR.VEHICLEID=NM.VEHICLEID (+) AND
PR.OCCUPANTID=NM.OCCUPANTID (+) AND
PR.PERSONTYPEID = 26711 AND
NM.STRIKEVEHICLEID>0
ORDER BY 1,2,3,4,5,6;

Similar Messages

Most efficient way to use thumbnails of multiple sizes

When a user submits an image on my website, the upload script
currently creates thumbnails in three different sizes (120px, 90px,
and 20px). Different thumbnail sizes are used in different areas of
the site.
Is there a more storage-efficient way to display high-quality
thumbnails in different sizes, without requiring a separate
thumbnail file for each size used?
I cannot rely on browsers to resize images as the quality is
often very undesirable.

AngryCloud wrote:
> I may not have been clear in my last post...
>
> When an image is viewed normally on a page, it is saved
to the client's
> computer so that it will load instantly the next time
the image is called for.
>
> I do not want visitors to have to wait for the same
images they have already
> seen to re-download and resample. A file of each
resampled image should be
> saved to the client's computer to avoid this.
>
>
Is it possible to save resampled images on a page to the
client's
> computer?
It sounds like your page needs to check whether the cached
version
exists before creating the a new image, otherwise its always
going to
create a new version of the image and send it to the
browser... but I
don't know how this is possible.
Dooza
Posting Guidelines
http://www.adobe.com/support/forums/guidelines.html
How To Ask Smart Questions
http://www.catb.org/esr/faqs/smart-questions.html

A more efficient way to assure that a string value contains only numbers?

Hi ,
I'm using Oracle 9.2.0.6.
I was curious to know if there was any way I could write a more efficient query to determine if a string value contains only numbers.
Here's my current query. This SQL is from a sub query in a Join clause.
select distinct cta.CUSTOMER_TRX_ID, to_number(cta.SALES_ORDER) SALES_ORDER
            from ra_customer_trx_lines_all cta
            where length(cta.SALES_ORDER) = 6
            and cta.SALES_ORDER is not null
            and substr(cta.SALES_ORDER,1,1) in('1','2','3','4','5','6','7','8','9','0')
            and substr(cta.SALES_ORDER,2,1) in('1','2','3','4','5','6','7','8','9','0')
            and substr(cta.SALES_ORDER,3,1) in('1','2','3','4','5','6','7','8','9','0')
            and substr(cta.SALES_ORDER,4,1) in('1','2','3','4','5','6','7','8','9','0')
            and substr(cta.SALES_ORDER,5,1) in('1','2','3','4','5','6','7','8','9','0')
            and substr(cta.SALES_ORDER,6,1) in('1','2','3','4','5','6','7','8','9','0')This is a string where I'm finding A-Z-a-z characters and '/' and '-' characters in all 6 positions, plus there are values that are longer than 6 characters. That's what the length(cta.SALES_ORDER) = 6 is for. Also, of course. some cells are NULL.
So the question is, is there a more efficient way to screen out only the values in this field that are 6 character numbers or is what I have the best I can do?
Thanks,

I appreciate all of your very helpfull workarounds. The cost is a little better in all cases than my original where clause.
To address the discussion that's popped up about design from this question, I can say a few things that should clear , at least, my situation up.
First of all this custom quoting , purchase order , and sales order entry system WAS written by a bunch a of 'bad' coders who didn't document their work and then left. We don't even have an ER diagram
The whole project that I'm only a small part of is literally trying to put Humpty Dumpty together again and then move it from a bad custom solution into Oracle Applications.
We're rebuilding, documenting, and doing ETL. This is one of your prototypical projects from hell.
It's a huge database project so we're taking small bites as a time. Hopefully, somewhere right before Armageddon hits, this thing will be complete.
But until then,..., well,..., you know the drill.
Thanks Again.

MDX - More efficient way?

Hi
I am still learning MDX and have written this code. It needs to recalculate all employees in a cost center (COSTCENTER is a property of the DIM EMPLOYEE) when one of the assumptions (e.g P00205 etc) change. These assumptions are planned on cost center level and planned against employee DUMMY. Is there a more efficient way to write this code as there are lots of accounts that needs to be posted to::
*SELECT (%EMPLOYEE%, ID, EMPLOYEE, [COSTCENTER] = %COSTCENTER_SET%)
//Workmens Comp
*XDIM_MEMBERSET P_ACCT = "IKR0000642000"
*FOR %EMP% = %EMPLOYEE%
         [EMPLOYEE].[#%EMP%] = ( [P_ACCT].[P00205],[EMPLOYEE].[DUMMY ]) * ( [P_ACCT].[P00400],[EMPLOYEE].[%EMP%] )
*NEXT
*COMMIT
//Fringe Benefits Employer
*XDIM_MEMBERSET P_ACCT = "IKR0000628100"
*FOR %EMP% = %EMPLOYEE%
         [EMPLOYEE].[#%EMP%] = ( [P_ACCT].[P00210],[EMPLOYEE].[DUMMY ]) * ( [P_ACCT].[P00400],[EMPLOYEE].[%EMP%] )
*NEXT
*COMMIT
//Fringe Benefits Other
*XDIM_MEMBERSET P_ACCT = "IKR0000626100"
*FOR %EMP% = %EMPLOYEE%
         [EMPLOYEE].[#%EMP%] = ( [P_ACCT].[P00209],[EMPLOYEE].[DUMMY ]) * ( [P_ACCT].[P00400],[EMPLOYEE].[%EMP%] )
*NEXT
*COMMIT

Maybe the following?
*SELECT (%EMPLOYEE%, ID, EMPLOYEE, [COSTCENTER] = %COSTCENTER_SET%)
*XDIM_MEMBERSET EMPLOYEE = %EMPLOYEE%
*XDIM_MEMBERSET P_ACCT = IKR0000642000,IKR0000628100,IKR0000626100
//Workmens Comp
[P_ACCT].[#IKR0000642000] = ( [P_ACCT].[P00205],[EMPLOYEE].[DUMMY] ) * ( [P_ACCT].[P00400] )
//Fringe Benefits Employer
[P_ACCT].[#IKR0000628100] = ( [P_ACCT].[P00210],[EMPLOYEE].[DUMMY] ) * ( [P_ACCT].[P00400] )
//Fringe Benefits Other
[P_ACCT].[#IKR0000626100] = ( [P_ACCT].[P00209],[EMPLOYEE].[DUMMY] ) * ( [P_ACCT].[P00400] )
*COMMIT
You should probably also restrict explicitly on all other dimensions in your applications so that none are accidentally left open that don't need to be.
Ethan

More efficient way to extract number from string

Hello guys,
I am using this Regexp to extract numbers from a string, and I doubt that there is a more efficient way to get this done:
SELECT regexp_replace (regexp_replace ( REGEXp_REPLACE (' !@#$%^&*()_+= '' + 00 SDFKA 324 000 8702 234 | " ' , '[[:punct:]]',''), '[[:space:]]',''), '[[:alpha:]]','') FROM dual
{code}
Is there a more efficient way to get this done ?
Regards,
Fateh

Or, with less writing, using Perl syntax \D (non-digit):
SELECT regexp_replace(' !@#$%^&*()_+= '' + 00 SDFKA 324 000 8702 234 | " ','\D')
FROM dual
REGEXP_REPLACE(
003240008702234
SQL>
{code}
SY.

Creating a time channel in the data portal and filling it with data - Is there a more efficient way than this?

I currently have a requirement to create a time channel in the data portal and subsequently fill it with data. I've shown below how I am currently doing it:
Time_Ch = ChnAlloc("Time channel", 271214 , 1 , , "Time" ,1 ,1) 'Allocate time channel
For intLoop = 1 to 271214
ChD(intLoop,Time_Ch(0)) = CurrDateTimeReal 'Create time value
Next
I understand that the function to create and allocate memory for the time channel is extremely quick. However the time to store data in the channel afterwards is going to be highly dependent on the length I have assigned to the Time_Ch. In my application the length of Time_Ch is variable but could easily be in the order of 271214 or higher. Under such circumstances the time taken to fill Time_Ch is quite considerable. I am wondering whether this is the most appropriate way of doing things or whether there is a more efficient way of creating a time channel and filling it.
Thanks very much for any help.
Regards
Matthew

Hi Matthew,
You are correct that there is a more efficient way to do this. I'm a little confused about your "CurrDateTimeReal" assignment-- is this a constant? Most people want a Time channel that counts up linearly in seconds or fractions of a second over the duration of the measurement. But that looks like you would assign the same time value to all the rows of the new Time channel.
If you want to create a "normal" Time channel that increases at a constant rate, you can use the ChnGenTime() function:
ReturnValue = ChnGenTime(TimeChannel, GenTimeUnit, GenTimeXBeg, GenTimeXEnd, GenTimeStep, GenTimeMode, GenTimeNo)
If you really do want a Time channel filled with all the same values, you can use the ChnLinGen() function and simply set the GenXBegin and GenXEnd parameters to be the same value:
ReturnValue = ChnLinGen(TimeChannel, GenXBegin, GenXEnd, XNo, [GenXUnitPreset])
In both cases you can use the Time channel you've already created (which as you say executes quickly) and point the output of these functions to that Time channel by using the Group/Channel syntax of the Time channel you created for the first TimeChannel parameter in either of the above functions.
Brad Turpin
DIAdem Product Support Engineer
National Instruments

Most efficient way to make an ordered list?

Hi all,
I have a simulation where I have agents running around in an environment. These agents need to get the closest agent near them, and they have to do this a whole bunch of times each cycle -- closest predator to them, closest prey, closest mate, next-closest mate if that one isn't interested, etc. etc.
I realized that it would be faster if I just got all the agents in the vicinity ONCE, kept them in a sorted list, and then everytime you want the closest agent of a certain type, just search from the bottom of the list up until you find the first one of that type.
So here's the question: to make that list, I ask the environment for all the agents in the vicinity, and then go through them one-by-one. I find out the distance between myself and that agent. I then.... what?
I could put them all into an ArrayList, and then apply some sorting algorithm to that ArrayList. Or I can try to insert them in the right order WHILE I'm making the ArrayList. Or maybe there's some better Collection object that would be even more efficient -- somehow pushing them in and out of stacks, or whatever else smart programmers think up.
Can anyone suggest the most efficient way to do this? This is something that every agent has to do every step, so efficiency is key.
Thanks!
Edit: As a note, calculating the distance between two agents isn't free, and if I either sort or insert as I'm making it, the naive implementation (i.e. the way I would do it...) would require re-checking this distance for every agent in the list every single time a new agent was added. So maybe I could make some use of a HashMap, so that I can store these distances?
Edited by: TimQuinn on Oct 15, 2009 9:35 AM

TimQuinn wrote:
Ok, thanks for all the great suggestions. I think that caching the distance in a wrapper object is a big plus, and then I can run some tests and see if using a built-in collections sorting algorithm or using a treeset is faster in my specific case. Thanks!
Any thoughts as to the idea of creating one giant map of the distance from each agent to every other agent just once, rather than having each agent work out their own distances to each other agent? I feel like this would be faster (at the expense of memory), but don't know how I'd start approaching it.Well, your idea of the Map would probably work. You would have to make some object that pairs up two agents, something like this:
public class AgentPair {
   private final Agent a1, a2;
   public AgentPair(Agent a1, Agent a2) { //...
   public boolean equals(Object other) {
      //if distance is a symmetric operation (a.distanceTo(b) == b.distanceTo(a)) then the reverse pair should also be equal
   public int hashCode() {
      return 37*a1.hashCode() + a2.hashCode();
}This assumes either that you don't override equals or hashCode in Agent, or that you properly override both.
Then you would have a map that you can populate, given an array of all agents:
Map<AgentPair, Double> distMap;
Agent[] agents;
for ( int i = 0; i < agents.length-1; i++ ) {
   for ( int j = i; j < agents.length; j++ ) {
      distMap.put(new AgentPair(agents, agents[j]), agents[i].distanceTo(agents[j]));
}Alternatively, if you're not sure you'll definitely use all of the computations, you could alternatively test to see if the computation result is in the map, and if not, perform it; otherwise, use the cached result.
Any thoughts? Should I make a new post? Abandon the idea?As always, try it and see. Essentially, it will be faster assuming these two conditions:
1) You would have to do more than n ^2^ (well actually n choose 2) distance calculations otherwise, and
2) Computing the distance costs more than retrieving from distMap (this +isn't+ a given!). If each Agent had a sequential ID, you could do a two-dimensional array of doubles which would speed up lookups.
Edited by: endasil on 15-Oct-2009 3:39 PM

EFFICIENT way of escalating an open task

I need to escalate TASKS that are still open after 31 days.
I figure i need 2 workflows to do this.
As i see it right now:
1st WF. Waits for 31 days after the task has been created. On the 31st day it changes a read only field called "escalate" to YES.
2nd WF checks for changes in tasks where: If (Status=OPEN AND escalate<>pre(escalate)) is true then send an escalete email or task.
Is there a more efficient way of doing this?
TIA
Paul

Is there a reason you want two worfklows? Why not put an e-mail action after the Wait on the same workflow? If you check the "Reevaluate Rule Conditions After Wait" checkbox on the Wait action, the workflow rule will be re-evaluated after your 31 days... so it would only send the e-mail message if the Task is still open (assuming your workflow condition is set to look at Status = Open).
Chris

SQL query with multiple tables - what is the most efficient way?

Hello I am learning PL/SQL. I have a simple procedure where I need to find number of employees and departments per location as per user input of location_id.
I have 3 Tables:
LOCATIONS
location_id (pk)
location_name
DEPARTMENTS
department_id (pk)
location_id (fk)
department_name
EMPLOYEES
employee_id (pk)
department_id (fk)
employee_name
1 Location can have 0-MANY Departments
1 Employee has 1 Department
Here is the query I came up with for PL/SQL procedure:
/*Ecount, Dcount are NUMBER variables */
SELECT SUM (EmployeeCount), COUNT(DepartmentNumber)
     INTO Ecount, Dcount
     FROM
     (SELECT COUNT(employee_id) EmployeeCount, department_id DepartmentNumber
          FROM employees
          GROUP BY department_id
          HAVING department_id IN
                    (SELECT department_id
                    FROM departments
                    WHERE location_id = userInput));
I do get the correct result, but I am just wondering if my query is on the right track and if there is a more "efficient" way of doing this.
Thanks in advance for helping a newbie out.

Hi,
Welcome to the forum!
Something like this will be more efficient:
SELECT    COUNT (employee_id)               AS ECount
,       COUNT (DISTINCT department_id)     AS DCount
FROM       employees
WHERE       department_id IN (     SELECT     department_id
                    FROM      departments
                    WHERE      location_id = :userInput
;You should also try a join instead of the IN subquery.
For efficiency, do only the things you need to do.
For example, you don't need a count of employees in each department, so don't compute one. That means you won't need the in-line view, so don't have one.
You don't need PL/SQL for this job, so don't use PL/SQL if you don't have to. (I realize this question was out of context, so you may have good reasons for doing this in PL/SQL.)
Do all filtering as early as possible. Don't waste effort computing things that won't be used .
A particular example of this is: Never use a HAVING clause when you can use a WHERE clause. What's the difference between a WHERE clause and a HAVING clause? The WHERE clause is applied before aggregate functions are computed, and the HAVING clause is applied after; there's no other difference. Therefore, if the HAVING clause isn't referencing an aggregate function, it could be done in a WHERE clause instead.

What is the efficient way of insert some bytes into a file?

Hello, everyone:
If I want to insert some bytes into a file (for example, insert the bytes before all the original content of the file, or append the bytes to a file), and the size of the original file is very big. I am wondering what is the efficient way? Where can I get some sample codes?
regards,
George

Thanks, DrClap.
I have tried your method and you are correct. I have written a simple program which can be used to insert "Hello World " to the start of a file ("c:\\temp\\input.txt"), and I have verified that it can work. Please help to see whether it is correct and whether it has a more efficient way.
public class TestDriver {
     public static void main(String[] args) {
          byte[] back_buffer = new byte [1024];
          byte[] write_buffer = new byte [1024];
          System.arraycopy("Hello World".getBytes(), 0, write_buffer, 0, "Hello World".getBytes().length);
          int write_buffer_length = "Hello World ".getBytes().length;
          int count = 0;
          FileInputStream fis = null;
          FileOutputStream fos = null;
          try {
               fis = new FileInputStream (new File("c:\\temp\\input.txt"));
               fos = new FileOutputStream (new File("c:\\temp\\output.txt"));
               while ((count = fis.read (back_buffer)) >= 0)
                    fos.write(write_buffer, 0, write_buffer_length);
                    System.arraycopy (back_buffer, 0, write_buffer, 0, count);
                    write_buffer_length = count;
               //write the last block
               fos.write(write_buffer, 0, write_buffer_length);
               fis.close();
               fos.close();
               //copy content back into original file
               fis = new FileInputStream (new File("c:\\temp\\output.txt"));
               fos = new FileOutputStream (new File("c:\\temp\\input.txt"));
               while ((count = fis.read (back_buffer)) >= 0)
                    fos.write(back_buffer, 0, count);
               fis.close();
               fos.close();
               //remove temporary file
               File f = new File ("c:\\temp\\output.txt");
               f.delete();
          } catch (FileNotFoundException e) {
               // TODO Auto-generated catch block
               e.printStackTrace();
               try {
                    fis.close();
               } catch (IOException e1) {
                    // TODO Auto-generated catch block
                    e1.printStackTrace();
               try {
                    fos.close();
               } catch (IOException e2) {
                    // TODO Auto-generated catch block
                    e2.printStackTrace();
          } catch (IOException e) {
               // TODO Auto-generated catch block
               e.printStackTrace();
               try {
                    fis.close();
               } catch (IOException e1) {
                    // TODO Auto-generated catch block
                    e1.printStackTrace();
               try {
                    fos.close();
               } catch (IOException e2) {
                    // TODO Auto-generated catch block
                    e2.printStackTrace();
}regards,
George

Most efficient way to track 3 states?

In a program I am writing, I have an object with three states, which it progresses through during the corse of the program. Since the program uses a lot of these objects (potentially) I want to keep the size of them down. Here's the issue. How to store what state the object is in? a boolean won't work, of corse, since there are three states. So here's what I can up with:
Either a Boolean (initial state is null, then false, then true)
or a byte (any three values would work)
I have a feeling that the byte is more efficient, but want to make sure. Also, if I'm missing an easy, efficient way to do this, tell me.

Nearly there:
<code>
public abstract class State {
abstract void handleState();
abstract int getState();
public class State1 extends State {
void handleState() {
//do state 1 specific stuff
int getState() {
return 1;
public class State2 extends State {
void handleState() {
//do state 2 specific stuff
int getState() {
return 2;
public class State3 extends State {
void handleState() {
//do state 3 specific stuff
int getState() {
return 3;
public class StateController {
private State currentState = new State1();
public int getState() {
return currentState.getState();
public void handleState() {
currentState.handleState();
</code>
might work ;)
As to booleans... no they cannot be null actually... they are represented by a bit which is 0 or 1 (or if you prefer true of false).
Boolean b = null;
is not a null boolean, it is an uninitialised object.
If you need an Object that you want to be a boolean then it is fine to use the Boolean class :)
The reason boolean b: b == null doesn't compile is because you cannot compare different types.

Most efficient way to pack U16 -- U32 Array for Data DMA Transfer?

I have an RT controller that wants to send down data to an FPGA using DMA. In LabVIEW 8.2, I have no choice but to pass down U32 blocks of data however my my input data is a U16 array. This leaves me two choices: 1) Wire the U16 Array directly to the DMA node which will coarse it to U32 but I'm wasting 16bit*#of elements 2) Pack the U16 array into a U32 Array prior to sending it down. I would like to do #2 and I have a method that works (and seems to be pretty efficient) but I have a feeling I am doing it the hard way (or roundabout way). Is their a simpler (but just as efficient) way to do this procedure? Thanks
Solved!
Go to Solution.
Attachments:
ni1.gif ‏8 KB
ni2.gif ‏10 KB

SiegeX wrote:
... unfortunately I forgot to mention that byte order does matter and odd # of inputs are allowed.
See, that something that does not make full sense here, because you end up with a mixed byte order, because the 16bit halves are still big endian. What's at the "other" end, exactly?
Anyway, here's a slight simplification of the previous code. (The typecast is better if we can do it all big endian and omit the "decomate/interleave" dance.)
(You could also flatten to a string and back. This has the advantage that byte order is a direct option. I don't know how that is, performance wise.))
Message Edited by altenbach on 11-12-2008 04:31 PM
LabVIEW Champion . Do more with less code and in less time .
Attachments:
typecasting3.PNG ‏4 KB

Most efficient way to load XML file data into tables

I have a complex XML file running into MBs. I want to load it's data into 7-8 tables.
Which way will be better:
1) Use SQL Loader to actually load directly into the 7-8 tables directly by modifying the control card.
Is this really possible and feasible? I am not even sure about it
2) Load data as XML Type in a table and register it. Then extract from there to load into various tables.
Please help. I have to find the most efficient way of doing it.
Regards,
Sudhir

Yes it is possible to use SQL*Loader to parse and load XML, but that is not what it was designed for and so is not recommended. You also don't need to register a schema, just to load/store/parse XML in the DB either.
So where does that leave you?
Some options
{thread:id=410714} (see page 2)
{thread:id=1090681}
{thread:id=1070213}
Those talk some about storage options and reading in XML from disk and parsing XML. They should also give you options to consider. Without knowing more about your requirements for the effort, it is difficult to give specific advice. Maybe your 7-8 tables don't exist and so using Object Relational Storage for the XML would be the best solution as you can query/update tables that Oracle creates based off the schema associated to the XML. Maybe an External Table definition works better for reading the XML into the system because this process will happen just once. Maybe using WebDAV makes more sense for loading XML to be parsed (I don't have much experience with this, just know it is possible from what I've read on the forums). Also, your version makes a difference as you have different options available depending upon the version of Oracle.
Hope all that helps as a starter.
Edited by: A_Non on Jul 8, 2010 4:31 PM
A great example, see the answers by mdrake in {thread:id=1096784}

Most efficient way to do some string manipulation

Greetings,
I need to cleanse some data in a string by replacing unsafe characters with encoded equivalents. (FYI, this is for the purpose of transforming "unsafe" characters into encoded values as data inside an XML document).
The following code accomplishes the task:
Note that a string "currentValue" contains the data to be cleansed.
A string, "encodedValue" contains the result.
for (counter = 0; counter < currentValue.length(); counter++)
    addChar = (currentValue.substring(counter,counter+1));
    if (addChar.equals("<"))
      addChar = "#60;";
    if (addChar.equals(">"))
      addChar = "#62;";
    if (addChar.equals("="))
      addChar = "#61;";
    if (addChar.equals("\""))
      addChar = "#34;";
    if (addChar.equals("'"))
      addChar = "#39;";
    if (addChar.equals("'"))
      addChar = "#39;";
    if (addChar.equals("/"))
      addChar = "#47;";
    if (addChar.equals("\\"))
      addChar = "#92;";
    encodedValue += addChar;
} // forI'm sure there is a way to make this more efficient. I'm not exactly "new" to java, but I am learning on my own with no formal training and often take a "brute force" approach with my initial effort.
What would be the most efficient way to re-do the above?
TIA,
--Paul Galvin
Integrated Systems & Services Group

im a c++ programmer so im not totally up on these java classes either but...from a c++ stand point you might want to consider using the if else statment.
by using if else, you only test the character until you find the actual "violating" character and skip the rest of the tests.
also, you might trying using something to check for alphaNumeric cases first and use the continue keyword when you find one. since more of your characters are probably safe than unsafe you can skip all the ifs/if else statement and only do one test on the good characters. (i just looked for a way to test that and i didnt find one. c++ has a function that does that by checking the ascii number range. dont think that works in java. but maybe you can find one, it would reduce the number of tests probably.)
happy hunting,
txjump :)

Most efficient way to apply Paragraph Style A to Paragraph style B?

I'm looking for the most efficient way to all
all aspects of an existing named paragraph style "A" to another named paragraph style "B". I'd especially like to find a keyboard-only way to do this.
To my surprise,
Copy Special >
Paste doesn't seem to copy tab settings...(?) This leads me to suppose that other aspects of the source p'style may not be crossing the Great Paste Divide.
Over the years I've used a variety of more or less clumsy multi-step, multi-tool "tricks" (including third-party plug-ins) to apply one named paragraph style to another, but knowing FrameMaker as I do I suspect there may be a truly efficient way to do what I want.
Is there?
Cheers & thanks,
Riley

Arnis:
8.0p277.
The Font family and style got Pasted -- that was immediately apparent. And based on all I know about F'Maker, I would've thought the tabs would go over.
But when I opened the target p'style the Tabs area was completely blank.
I'm not sure if anything else wasn't making it 'cross the Paste Divide: Once the Tabs weren't Pasted, I fell back to a different, brute-force strategy simply to get around the problem and return to work...
Moreover, since the structured templates I inherited for this project are full of idiosyncrasies, I'll just file this one away under "The Templates Did It" and hope for better luck the next time I try the Copy Special thing...
Cheers & thanks for your help,
Riley

More cost efficient way??

Similar Messages

Maybe you are looking for