Fidessa Fragmentation Index

10 More Discussions You Might Find Interesting

1. UNIX for Advanced & Expert Users

Memory fragmentation in a Linux settop box

Being a moderator at openATV, a forum for Linux settup boxes, I have seen reports, and sometimes am experiencing myself, artefacts during video playback or timeshift. As the artefacts are non repetetive (rewinding and watching again does not show artefacts), I can exclude a corrupted video source....

2. IP Networking

IP fragmentation problem

Hello all, I am experiencing a problem with IP fragmentation. I am receiving an udp packet that is larger than the MTU and it is fragmented along the network. I am receiving the two fragments but they are not being reassembled correclty. The MTU of the system is 1500 and I cannot increase it,...

3. Emergency UNIX and Linux Support

calculate internal fragmentation in directory

hi sorry for grammar mistakes but i am writting these fro tablet and am not realy used to ot so well yet.... i am in the middle of doing work here and hope some1 ca answear my question asap please :-) How to calculate the amount of internal fragmentation using script. cd directory ......

4. HP-UX

Heap fragmentation on HPUX

Hi All, We are facing issues on HPUX with the C heap region growing. We use a product for CRM by name ClarifyCRM and it uses a native layer for DB access. so there are best practices in place to actual control memory. recently we have seen issues that the C heap region is growing faster than...

5. Shell Programming and Scripting

Sort from start index and end index in line

Hi All, I have a file (FileNames.txt) which contains the following data in it. $ cat FileNames.txt MYFILE17XXX208Sep191307.csv MYFILE19XXX208Sep192124.csv MYFILE20XXX208Sep192418.csv MYFILE22XXX208Sep193234.csv MYFILE21XXX208Sep193018.csv MYFILE24XXX208Sep194053.csv...

6. UNIX for Dummies Questions & Answers

wh inode index starts from 1 unlike array index (0)

brothers why inode index starts from 1 unlike array inex which starts from 0 its a question from the design of unix operating system of maurice j.bach i need to know the answer urgently...someone help please

7. Filesystems, Disks and Memory

why the inode index of file system starts from 1 unlike array index(0)

why do inode indices starts from 1 unlike array indexes which starts from 0 its a question from "the design of unix operating system" of maurice j bach id be glad if i get to know the answer quickly :)

8. Solaris

Fragmentation Ratio

All. How can i calculate the fragmentation ratio on a mounted disk, given that i have no root privilege and i cannot switch to single user mode.

9. UNIX for Dummies Questions & Answers

Fragmentation command in linux?

Hi, Please let me know more details on fragmentation in redhat linux and command to check fragmented files? Thanks, Bache Gowda

10. IP Networking

IP fragmentation

HI all, I am in urgent need of this answer. In TCP/IP protocol, If the IP datagram size > MTU of the any routing network then the IP fragmentation takes place! Where exactly the Fragmentation takes place? is it at the source network layer or in between at some router? If so, which of the...

LEARN ABOUT DEBIAN

tm::index::match

TM::Index::Match(3pm)					User Contributed Perl Documentation				     TM::Index::Match(3pm)

NAME

       TM::Index::Match - Topic Maps, Indexing support (match layer)

SYNOPSIS

	   # somehow get a map (any subclass of TM will do)
	   my $tm = ...

	   # one option: create a lazy index which learns as you go
	   use TM::Index::Match;
	   my $idx = new TM::Index::Match ($tm);

	   # for most operations which involve match_forall to be called
	   # reading and querying the map should be much faster

	   # learn about some statistics, what keys are most likely to be useful
	   my @optimized_keys = @{ $stats->{proposed_keys} };

	   # another option: create an eager index
	   my $idx = new TM::Index::Match ($tm, closed => 1);

	   # pre-populate it, use the proposed keys
	   $idx->populate (@optimized_keys);
	   # this may be a lengthy operation if the map is big
	   # but then the index is 'complete'

	   # query map now, should also be faster

	   # getting rid of an index explicitly
	   $idx->detach;

	   # cleaning an index
	   $idx->discard;

DESCRIPTION

       This index implements a generic query cache which can capture all queries not handled by more specific indices. This class inherits
       directly from TM::Index.

INTERFACE

   Constructor
       The constructor/destructors are the same as that described in TM::Index.

   Methods
       populate
	   $idx->populate (@list_of_keys)

	   To populate the index with canned results this method can be invoked. At this stage it is not very clever and may take quite some time
	   to work its way through a larger map. This is most likely something to be done in the background.

	   The list of keys to be passed in is a bit black magic. Your current best bet is to look at the index statistics method, and retrieve a
	   proposed list from there:

	      @optimized_keys = @{ $stats->{proposed_keys} };

	      $idx->populate (@optimized_keys[0..2]); # only take the first few

	   If this list is empty, nothing clever will happen.

       statistics
	   $hashref = $idx->statistics

	   This returns a hash containing statistical information about certain keys, how much data is behind them, how often they are used when
	   adding information to the index, how often data is read out successfully. The "cost" component can give you an estimated about the
	   cost/benefit.

SEE ALSO

       TM, TM::Index

COPYRIGHT AND LICENSE

       Copyright 200[6] by Robert Barta, <drrho@cpan.org>

       This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

perl v5.10.1							    2008-04-10						     TM::Index::Match(3pm)

Complex Event Processing RSS News