Suffix Tree Disk Based

I am doing a senior project with the topic of Genomic Code Searching. I've already done the java code for building suffix tree and also can be used for searching from the created tree with memory based version. Now I have a problem with the disk base version since my advisor want me to do suffix tree disk base version to handle a large size of human genome. He suggested me to read papers such as http://www.eecs.umich.edu/~jignesh/publ/stc.pdf and try to implement one of them. Anyone have an experience in doing this kind of program. I can understand the algorithm in some paper but anyway I can't implement it. Please give me the code or give me some suggestion about this. The advisor need me to compare the performance of disk based version with my program in memory based version. It would be grateful if anyone can give me the code.
Thank you so much

Sorry about this but i'm not asking others to do my project. I've already done the programming in memory based version but for the disk based one my advisor told me that you can download the code from internet and try to use it to compare the performance with my program. Since all papers about disk base suffix tree are the Phd thesis, I sincerely say that I don't have enough ability to implement as the published paper. I just need some code and compare the performance of that program with my own program to see the difference between memory base and disk base.
Or anyone can give me some suggestion? Sorry for making some misunderstanding. I just need some help to make the experimental part about performance of my program is completed. Thanks again

Similar Messages

Issues while migrating data from a disk based table to a memory optimized table

Hi All,
I have a Disk based table with 400000000 rows in it, We are trying to convert it into a memory optimized table.
We have already created a memory optimized table with similar structure and trying to import data into this mem optimized table using 'insert into' from the disk table.
I am trying to Migrate around 10000000 rows at a time, but I am getting an error 'There is insufficient system memory in resource pool 'default' to run this query.' Altough we have 128 GB RAM on the server and SS is utilizing more than 120 GB RAM.
Altough the query has been cancelled.
Wanted to Know how could we migrate the table with the available RAM or do we have increase our RAM?
aa

Josh,
Microsoft's documentation on this subject isn't at its best right now (I believe there will be incremental improvements for better understanding), but here is what I read so far.
http://msdn.microsoft.com/en-us/library/dn133190.aspx
"A hash index consists of a collection of buckets organized in an array. A hash function maps
index keys to corresponding buckets in the hash index."
Judging by this statement, a hash index is a hash table just like the ones used as work tables for hash operators in queries (hash matching or grouping). Doesn't contain (or include) other columns, i. e. it doesnt store any data.
"Multiple index keys may be mapped to the same hash bucket."
This means there is some kind of mapping, but this is not explained in the article above. However...
http://msdn.microsoft.com/en-us/library/dn282389.aspx
"For each hash index in the table, each row has an 8-byte address pointer to the next row in the index. Since there are 4 indexes, each row will allocate 32 bytes for index pointers (an 8 byte pointer for each index)."
Each row (in the table) has a pointer (for every index, 1:1 ratio) that points to a row (also known as bucket) in the hash index. So that is how the aforementioned mapping works huh!
> What happens if you include a column in two or three different indexes, or is that not allowed?
My conclusion is that the hash indexes works the same way as a hash worktable, with the addition of the column in the base table that is added to store pointers to the hash index.
When you create a new index, even if you use the same column twice, a hash table is created, hash calculations are distinctly made for each key and stored on it, and while this is done, the column that is exclusively used for this new index is populated
with pointers to this index. You can add a given column to the set of keys of different hash indexes as many times as you want. Correct if i'm wrong, I'm also new on this subject :D

Why there is a huge difference between a row size on a disk based table and a row size in memoptimized table of SQL 2014?

Hi All,
I have two table with similar structure and data, one is on disk and the other is in memory. I somehow calculated the difference between a row size of on disk and in memory table and found that the row size of in memory is 700 Bytes more than the disk based
tables.
aa

As others mentioned, memory optimized tables and disk based tables have different structures in SQL Server 2014.
For memory optimized tables, the number of indexes on table also contribute to the size. You can calculate the exact size of rows and thus the table size using the formula given in the below articles
Table and Row Size in Memory-Optimized Tables
Estimate the Size of a Table
Krishnakumar S

Suffix Tree and similar

Hi,
I'm stuck with the app i'm writing and i really need some good ideas.
The basic problem is:
I generate a list of string, everytime i produce a new string i need to check if it is already present in the list, if not i add it to the list.
Each string is ordered and the list is ordered only respect to the first char.
To cope with that i used Tree structure similar to a Suffix Tree where i insert the string into the tree and it easily checks if the string is already present or not.
The tree works well but with strings of length 7 or more the heap goes out of bound.
Maybe i need a better implementation of the suffix tree,
do you know any?
or some other idea that requires lower space?
Thanks in advance!

Use a Hashset and not a list. It's exactly for that purpose.
You can later still fill that Set into a List and use a Comparator for custom sorting.

Unable to setup disk-based store for IWSSessionManager

Help me, please...
I was able to setup disk-based store for IWSSessionManager in my test environment using options in contexts.properties but in my production enviroment is not working at all...
Server is working (restarts) fine and accepted changed maximum number of sessions but I don't see any new session files created in SessionData dir - and I for sure should be able to see few dozens of them...
Any ides why or how can I troubleshoop the problem?
Server is iPlanet Webserver 6.0SP4.

I'll jump in with a similar issue. If I try to access 192.168.1.1 on my brand new WRT54G I get "The address is not valid". This is with firewall and antivirus switched off, the cable from the router to my DSL modem pulled (if it's plugged in I go right through the router and get the setup page on my DSL modem), and an address of 192.168.0.102 assigned automatically.
Any help would be appreciated so I can finish upping the security level on my home network.

Suffix tree clustering algorithm?

I am studying in my final year of computer science and i need to get hold of a suffix tree clustering algorithm that can be used in javascript. I have searched all over the net but have come up with nothing and was wondering if anybody could help!

In the section, "Longest Repeated Substring", it says, "the longest repeated substring of txt[1..n] is indicated by the deepest fork node in the suffix tree, where depth is measured by the number of characters traversed from the root".
However, it doesn't seem to be always true(hmm...probably I interpret it incorrectly).
Consider the original string = abb$
(with index 1234)
the suffix tries looks like
bb$
root--------------
|
| abb$
|----------
the suffix tree looks like
(2,4)
root-------------
|
| (1,4)$
|---------
However, there isn't even a fork node.
But obviously, b is the longest repeated string.
Another example
Consider the original string = abc$
(with index 1234)
the suffix tries looks like
c$
root--------------
|
| bc$
|----------
|
|
| abc$
|----------
the suffix tree looks like
(3,4)
root--------------
|
| (2,4)
|----------
|
|
| (1,4)
|----------
However, there isn't even a fork node either. But in this case, there is no repated string.
Hope anyone can answer this. Thanks.

Suffix Tree Library

Is there any library for creation of suffix tree and which also has a method to search a substring in the suffix trees ??

Now posted at [java-forums.org|http://www.java-forums.org/advanced-java/16734-suffix-tree-library.html].

Unable to create system performance counter SharePoint Disk-Based Cache - SharePoint 2010 SP2 Farm

Hi,
I'm getting this in my Trace Logs:
Performance Counter OS (pdh) call failed with error code PDH_CSTATUS_BAD_COUNTERNAME
PDH failure on counter <serverName>\Sharepoint Disk-Based Cache\Blob Cache hit ration with Unknown error (0x0000bc0)
Unable to create system performance counter <ServerName>\SharePoint Disk-Based Cache\\Blob Cache fill ratio
Unable to create system performance counter <ServerName>\SharePoint Disk-Based Cache\\Total Blob Size
There are bunch of them from SharePoint Disk-Based Cache counter that its trying to create but they cannot be used.
I've logged on to the server as a farm admin, which has full farm permissions, local admin and runs OWSTIMER.EXE service, but I was not able to add the counters myself. I've read few posts here on TechNet but no one answered on how to enable/recreate these
performance counters. I would like to resolve this if its possible.

I could not find the reason why those SharePoint Performance Counters were not on the WFE servers so I just disabled the "Diagnostic Data Provider: Performance Counters - Web Front Ends" in the Central Admin > Monitoring > Job Definitions.

Installing a disk based product through download?

So I purchased a disk based version of Adobe Creative Suite Production Premium 5.5, and I find myself wanting to intall it on another computer. However, the computer in question doesn't have a disk drive, so I have no way of installing it.
Is it at all possible to download a copy of the product from the Adobe website after purchasing it in disk form?

You can download the trial version of the software thru the page linked below and then use your current serial number to activate it.
Be sure to follow the steps outlined in the Note: Very Important Instructions section on the download pages at this site or else the download will not work properly.
CS5.5:
http://prodesigntools.com/adobe-cs5-5-direct-download-links.html

WAE 674 Disk based software not installed.

Hi,
Have an WAE 674 with 4.4.3c installed, with problem.
Using WCCP and I am able to logon to the device.
Have this msg and in in the CM it is down.
System Initialization Finished.
Disk based software not installed.
Some applications may not run correctly!
Any sugestion?
I have reload still problem.
Regards Jan Rockstedt

What steps did you take to resolve the issue? I have the same issue on WAVE 594 running 4.4.5.
I get the error message when I telnet into device.

Good opensource library for suffix trees, longest common subsequence ..?

What opensource / free (preferably GPL/LGPL licensed) libraries for suffix trees, longest common subsequence and longest common contiguous subsequence do exist for Java?
Any practical experiences?

What opensource / free (preferably GPL/LGPL licensed) libraries for suffix trees, longest common subsequence and longest common contiguous subsequence do exist for Java?
Any practical experiences?

JDev10g: Using a Tree component based on different queries.

Hello,
I've been doing some research on how to implement a tree component in ADF which I got working. However I need to implement a tree component that uses several different queries.
The parent node would be one query, the child/leaf nodes would be based on another query but still related to the parent.
For Example: 'select parent_nodes from mydatabase' then 'select child_nodes from mydatabase where child_nodesID = parent_nodesID'
This will ultimately have to branch down more levels but I'm not sure exactly how to achieve this. I'm thinking I have to create new View Objects but I'm not sure exactly how to do that either.
Thank you in advance.

For an SQL query on a database use a View Object. First, you will need to create a new Entity object to represent each table in the database you need to use in the queries. Once you have created your view objects with their correct SQL queries, you need to specify how they are related. Example:
RootView is all elements with ParentId of null.
OtherView is all elements with ParentId not null.
RootToOtherLink is a view link which links RootView.Id to OtherView.ParentId. You can specify this in the dialog. You will want to select all accessors available to make your life easier later, but make sure to name them something you will recognize, like "RootToOtherDestination".
You will also need OtherToOther Link which links OtherView.Id to OtherView.ParentId. This starts the recursive nature of the hierarchical relationship.
Once you have this set up, you will need to create an Application Module so that you have a data control you can bind your tree to. Set up the data model in a hierarchical fashion using your link.
This will create a data control on the Data Controls pane you can drag onto your .jspx page. A menu will show up from which you can select tree component. This will take you to the tree binding dialog. Here is where all your work so far will pay off. You want to click the green plus button to add your RootView. Then, with the RootView selected you will want to hit the green plus again to select your destination accessor, such as "RootToOtherDestination" as mentioned earlier. This will show the OtherView as a child of the RootView. Finally, with OtherView selected you will want to hit the green plus again and select your other destination accessor, such as "OtherToOtherDestination". Select the attributes you want to have available to your tree at the bottom of the dialog and click ok.
Your tree will show up. If you want to customize the way it looks or especially the attributes it displays in a node, those can be edited in the <af:tree> tag on your .jspx page.

Tree menu based on session variable?

Hi all,
is there somewhere a javascript or php or html (or extension)
tree menu
that will highlight the current branch based on a session (or
cookies, at
least) variable content?
I cannot fint it anywhere.
TIA
tony

hi Christian,
Thanks for your help,
Here is my situation, I have a fact table of very high volume, because of which reports are taking lot of time in displaying results. Recently I have been assigned one of these reports and asked to improve its performance. so, I thought to use a opaque view(thought to apply all the fact related reports filters into WHERE Clause using session variables which can bring down table volume) and then switch this table source with original fact table using 'dynamic' table under existing alias table definition with the help of session variable. The purpose of this table switch is, all existing reports will source from original fact table, where as modified report will be sourcing from opaque view.
I would like to try to your suggested approach "creating a placeholder column which contains the exact variable string content for the table source and the opaque view source respectively", but how does OBIEE switch priority of these LTS, can you please explain me this approach a bit further.
Thanks,
vijay

Questions on in-memory with disk based overflow cache.

Hi, support
I want to create a cache which have two tiers, one is size limited local cache and the other uses a disk as a storage. As you said if the local cache is full, the other data will be moved to external cache (on disk). Does it mean the other data will be saved in a temp file? If so, could you let me know where is temp file? The config file is attached.
Btw, although I used on disk cache as a external cache, I got Exception in thread "main" java.lang.OutOfMemoryError: Java heap space also when I put lots of data into the cache.
Thanks a lot.
<?xml version="1.0"?>
<!DOCTYPE cache-config SYSTEM "cache-config.dtd">
<cache-config>
     <caching-scheme-mapping>
                    
          <cache-mapping>
               <cache-name>bufferStorage</cache-name>
               <scheme-name>SampleOverflowScheme</scheme-name>
          </cache-mapping>
     </caching-scheme-mapping>
     <caching-schemes>
          <overflow-scheme>
               <scheme-name>
                    SampleOverflowScheme
               </scheme-name>
               <front-scheme>
                    <local-scheme>
                         <high-units>100</high-units>
                    </local-scheme>
               </front-scheme>
               <back-scheme>
                    <external-scheme>
                         <lh-file-manager/>
                         
                    </external-scheme>
               </back-scheme>
          </overflow-scheme>
     </caching-schemes>
</cache-config>
Message was edited by:
user620684

Hi, Jon
Thanks for your help.
I will use an unconfigured LH file manager(I mean the file path and name will not be specified.).
Currently, find the temp file will be created in C:\Documents and Settings\$user_name\Local Settings\Temp in windows.
I have two questions on temp file.
1) Does tangosol supply a mechanism to maintain the temp files?
2) In solaris, which place will the temp file be created in?
Thanks,
Bin
null

Download a smartform on local disk based on transport request

Dear Experts,
        I want to given on selection screen transport request and path .If in this tranport request there is any
       smartform ,all download on local disk.
So what sud i have to do for this.Please give me a example for it.
Thanks,
Jatin sangal

HI,
Use this below function module to get the spool to an internal table.
CALL FUNCTION 'CONVERT_OTFSPOOLJOB_2_PDF'
       EXPORTING
            src_spoolid              = l_spool_id
       IMPORTING
            pdf_bytecount            = g_bin_filesize
       TABLES
            pdf                      = ipdf
       EXCEPTIONS
            err_no_otf_spooljob      = 1.
The data will be fetched to IPDF internal table, then u can use GUI_DOWNLOAD function module to download this file to your specific location as below.
CALL FUNCTION 'GUI_DOWNLOAD'
       EXPORTING
            bin_filesize            = g_bin_filesize
            filename                = g_file
            filetype                = 'BIN'
       IMPORTING
            filelength              = g_file_size
       TABLES
            data_tab                = ipdf
       EXCEPTIONS
            file_write_error        = 1.
Thanks,
Ravi

Suffix Tree Disk Based

Similar Messages

Maybe you are looking for