Abstract: A database may be virtually partitioned into virtual partitions. The virtual partitions are mapped to physical databases of a database. Data records added to the database are each assigned to a virtual partition and stored in the physical database mapped to the assigned virtual partition. The identifier generated for a data record includes an identifier of the assigned virtual partition. When additional databases are created, virtual partitions are remapped to the larger space of physical databases.

Abstract: A system and method for merging a first database with a second database (one-way merge), and a system and method for merging two databases with one another (two-way merge) is described herein. During the one-way merge, new or updated records are transferred from a copy of a client database to a server database after it is determined that the server database either does not contain one or more records in the copy of the client database or contains an older version of one or more records in the copy of the client database. During the two-way merge, new or updated records are transferred between a client database and a server database after it is determined that either the client database or the server database does not contain one or more records in the other database or contains an older version of one or more records in the other database.

Abstract: A method to optimize recategorization of financial transactions using collaborative filtering involves obtaining a set of financial transactions of a set of users with a merchant. The method also involves determining, using a processor, a first portion of the set of financial transactions assigned to each recategorization value of a set of recategorization values; determining, using the processor, a second portion of the set of financial transactions where the each recategorization value is different from an initial category; generating, using the processor, a recategorization index for each recategorization value using the first portion of each recategorization value and the second portion; and determining, using the processor, an alternative categorization candidate based on the recategorization index of the each recategorization value.

Abstract: A data format is optimized for storing data such as website traffic data. The data format enables easy access to and filtering of data, for example in generating website traffic reports. The data format also provides significant data compression. A method for generating a data file according to the data format employs linear compression and indexing to efficiently store the data. Data stored according to the format can be easily retrieved, particularly when a known value is specified and particular entries matching the known value are sought.

Abstract: A line of business data integration (“LOBI”) stack is provided that is configured to store an abstract representation of a mechanism utilized by a line of business (“LOB”) system to return requested LOB data in batches. When a request is received from a client for the LOB data, the LOBI stack utilizes the abstract representation to retrieve the requested LOB data from the LOB system in batches. In this manner, the batching mechanism utilized by the LOB system is abstracted from the client.

Abstract: A method and apparatus implementing a “hadron” data structure architecture. In some embodiments, each hadron includes a frame identifier and a holder for a payload of data, wherein the plurality of hadron data structures are stored in a hadron block that provides a specification that includes metadata that specifies the payload. Some embodiments include a plurality of hadron blocks first and second hadron data blocks, each block including one or more hadron pages. Upon receiving data particles of a dataset, the system forms a first plurality of hadron data structures (hadrons) by creating a first frame identifier and associating the first frame identifier with a first data particle to form the first hadron, and creating a second frame identifier and associating the second frame identifier with a second data particle to form the second hadron, and stores the first plurality of hadron data structures in the first hadron page.

Abstract: A method and system for managing website blacklists to control website access of a user. In one embodiment, a client queries a database regarding a location of a website before the client fetches a resource from the website. The database includes a list of websites based on which access by the client is controlled. If the location of the website in the query exists in the database, the client displays a warning dialog and receives a user input. The client determines whether to continue fetching the resource based on the user input to the warning dialog.

Abstract: The present invention relates to a system that includes one or more logical volumes for storing data; a snapshot producing section for producing snapshots for the logical volumes based on a pre-scheduled snapshot acquisition time; a remote copy section for remote copying difference data for the snapshots based on pre-scheduled remote copy start times; and a scheduling section for re-scheduling the time of one or more of an Nth snapshot acquisition time, an remote copy start time, and an (N+1)th remote copy start time, in such a manner that remote copying starting at the Nth remote copy start time finishes by the (N+1)th remote copy start time.

Abstract: An apparatus performs a first search for first information that contains a first character input through an operation, and performs a second search for second information that contains both of the first character and a second character when the second character is input after the first search is started. Before the searches are performed, either a first search mode or a second search mode is selected: in the first search mode, a search is started for the first information independently of an input of the second character after the input of the first character; and in the second search mode, a determination is made whether or not there is an input of the second character after the input of the first character, and a search is started for the first information when there is no input of the second character is selected.

Abstract: Techniques for selectively translating resource requests from a program running on a computer system are disclosed. The resource request may be a request to access a file, library file, API, etc. The resource request may be a system call or library call. The computer program may be non-native to the computer system. Translation of resource requests may occur within the operating system or outside it. A resource request containing a reference to a first path and file name may be selectively translated by altering the resource request to contain a reference to a second path and file name. After selectively translating a request, he request is caused to be serviced. A resource request may be serviced by forwarding it to an operating system, and a result may be sent back to the program.

Abstract: A system comprising an associative memory, an input module, a query module, and a display module. The input module is configured to receive a value within a first perspective of the associative memory. The query module is configured to perform an open query of the associative memory using the value, perform the open query within at least one of an insert perspective and a second perspective of the associative memory. The at least one of the insert perspective and the second perspective has as many or more category associations for the value relative to the first perspective. The display module is configured to display a result of the query and to display a list of one or more potential ambiguities that result from the open query.

Abstract: Various embodiments for efficiently provisioning a storage area network (SAN) are provided. In one embodiment, SAN information is provided to an engine for optimization. The SAN information includes at least one of SAN configuration information, SAN usage information, at least one cost profile, and at least one chargeback model. Based on the SAN information, those of an available plurality of storage resources not meeting at least one storage criterion are filtered. The filtered storage resources are ranked on a cost basis. A resource configuration graph is constructed based on the ranked storage resources. The resource configuration graph is traversed to obtain a plurality of possible SAN configuration plans. At least one power profile is applied to the plurality of possible SAN configuration plans to rank the plurality of possible SAN configuration plans by energy consumption.

Abstract: In a KStore having K nodes with respective K node counts a method for updating the K node counts includes processing a K node in accordance with a received particle to provide a processed K node and updating a node count in response to the processing. The processing of the processed K node includes building the processed K node in response to the received particle. A node count of a beginning of sequence node is updated. A beginning of sequence node includes a beginning of thought node. The received particle can be a particle of sensor data having a corresponding sensor node to provide a sensor node determination. A node count of the corresponding sensor node is updated in response to the sensor node determination. A subcomponent node is determined in response to the sensor determination and a K node count of the subcomponent node is updated.

Abstract: A method of consolidating records from databases is disclosed. The method comprises initially making a first identification of a candidate match between records using a first search technique. The method further comprises making a second identification of a candidate match between records using a second search technique, and displacing the first identification of a candidate match between records based on a probability that the second identification is correct.

Abstract: Method, system, and programs for computing similarity. Input data is first received from one or more data sources and then analyzed to obtain an input feature vector that characterizes the input data. An index is then generated based on the input feature vector and is used to archive the input data, where the value of the index is computed based on an improved Johnson-Lindenstrass transformation (FJLT) process. With the improved FJLT process, first, the sign of each feature in the input feature vector is randomly flipped to obtain a flipped vector. A Hadamard transformation is then applied to the flipped vector to obtain a transformed vector. An inner product between the transformed vector and a sparse vector is then computed to obtain a base vector, based on which the value of the index is determined.

Abstract: Embodiments of desktop agents for use in file management are disclosed. Specifically, in certain embodiments a set of desktop computers within a particular networked environment where it is desired to install these desktop agents may be determined. Desktop agents may then be installed on these desktops. A desktop agent on a particular desktop computer may register with an appliance such as that described above and be given an objective including one or more tasks. For each of the tasks provided, the desktop agent may return a list of files which can be collected based on the classification(s) associated with that task. Specific files to collect may then be selected from the list of files such that these specific files may be sent from the desktop computer to the appliance by the desktop agent and stored.

Abstract: Slideshow video file detection. A method includes receiving a search query for video files of a desired type. A portion of a video file is extracted. A frame difference based histogram and an active pixel based histogram are generated for the portion. Further, the frame difference based histogram and an active pixel based histogram are provided to a machine learning tool. An indicator is determined for the portion based on a plurality of parameters. The video file is classified as the desired type based on the indicator. The video file is provided to the user.

Abstract: Indexing data is disclosed. A plurality of subunits of data is determined within received data. For a first subunit, a first mapping between the first subunit and a first dictionary entry is determined. For a second subunit, a second mapping between the second subunit and a second dictionary entry is determined. At least the first and second dictionary entries are aggregated into an aggregation and stored in an index. Searching data is also disclosed. A plurality of subunits of data is determined within a received query. For a first subunit, a first mapping is determined between the first subunit and a first dictionary entry. For a second subunit, a second mapping is determined between the second subunit and a second dictionary entry. The first and second dictionary entries are aggregated and used to search an index.

Abstract: Virtual file system virtual nodes are grouped in subpools in response to identified resource components and managed as a function of their subpool groupings. Virtual nodes are decomposed into individual components linked to each other within each node. The components that have repetitive accesses by applications within the virtual file system and their respective frequencies of repetitive access are identified. Modules of linked occurrences of the repetitive components within each of the plurality of virtual nodes are formed, and subsets of the virtual nodes sharing common modules are grouped into subpools. Accordingly, in response to an application of the virtual file system requesting a service that is satisfied by a subpool common module, selection of a virtual node for reinitiating for reuse by the application is restricted to virtual nodes within the subpool associated with the common module.

Abstract: An efficient parallel process can be performed in a distributed manner by an original master node set in a highest-layer sub-cluster and one or more lower-layer master nodes set in respective lower-layer sub-clusters.