Abstract: Embodiments of the invention provide data management solutions that go beyond the traditional warehousing system to support advanced analytics. Furthermore, embodiments of the invention relate to systems and methods for extracting data from an existing data warehouse, storing the extracted data in a reusable (intermediate) form using data parallel and compute parallel techniques over cloud, query processing over the data with/without compute parallel techniques, and providing querying using high level querying languages.

Abstract: A random number generation process generated uncorrelated random numbers from identical random number sequences on parallel processing database segments of an MPP database without communications between the segments by establishing a different starting position in the sequence on each segment using an identifier that is unique to each segment, query slice information and the number of segments. A master node dispatches a seed value to initialize the random number sequence generation on all segments, and dispatches the query slice information and information as to the number of segments during a normal query plan dispatch process.

Abstract: Systems and methods for managing data, such as metadata. In one exemplary method, metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. Other methods are described and data processing systems and machine readable media are also described.

Abstract: Techniques are provided for storing files in a parallel computing system based on a user-specified parser function. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a parser from the distributed application for processing the plurality of files prior to storage; and storing one or more of the plurality of files in one or more storage nodes of the parallel computing system based on the processing by the parser. The plurality of files comprise one or more of a plurality of complete files and a plurality of sub-files. The parser can optionally store only those files that satisfy one or more semantic requirements of the parser. The parser can also extract metadata from one or more of the files and the extracted metadata can be stored with one or more of the plurality of files and used for searching for files.

Abstract: Methods and systems for extending keyword searching techniques to syntactically and semantically annotated data are provided. Example embodiments provide a Syntactic Query Engine (“SQE”) that parses, indexes, and stores a data set as an enhanced document index with document terms as well as information pertaining to the grammatical roles of the terms and ontological and other semantic information. In one embodiment, the enhanced document index is a form of term-clause index, that indexes terms and syntactic and semantic annotations at the clause level. The enhanced document index permits the use of a traditional keyword search engine to process relationship queries as well as to process standard document level keyword searches.

Abstract: The present invention discloses devices including a transparent client-connection manager for exchanging client data between application servers and the device: a request analyzer for analyzing query requests from at least one application server; a data-retrieval/command-execution module for executing query requests; a database connection manager for exchanging database data between at least one database server and the device; a cache-memory pool for storing data items from at least one database server; a cache-policy module for determining cache criteria for storing the data items In the cache-memory pool; and a data-consistency invalidation module for determining invalidated data items based on invalidation criteria for removing from the cache-memory pool. The cache-memory pool is configured to utilize memory modules residing in data proxy devices and distributed cache management utility, enabling the memory capacity to be used as a cluster to balance workloads.

Abstract: Embodiments of the invention provide a solution to optimize/minimize the total capacity of Gold Image within the entire datacenter which utilizes a scale-out type of storage systems. A method of server image provisioning comprises checking whether a gold image exists in a first storage system, the gold image being one of a real gold image or a virtual gold image; if no gold image exists in the first storage system, searching a remainder of the storage systems until a real gold image is found in a second storage system; after finding the real gold image in the second storage system, creating a virtual gold image in the first storage system, the virtual gold image in the first storage system being associated with the real gold image in the second storage system; and creating a snapshot volume in the first storage system based on the virtual gold image.

Abstract: Multiple search indexes can be served from a common set of resources. Instead of requiring a processor to be dedicated to serving a single search index, a processor can provide responsive documents for search queries that are based on different ranking algorithms and/or different sets of documents.

Abstract: A database system provides vertical or horizontal pre-packing of database data elements according to a size of physical processor words in order to obtain improved parallel processing at the bit level. After processor words are populated with data from multiple data elements of the database, query operations are used which may simultaneously process the multiple data elements in each data word simultaneously in the computer arithmetic logic unit.

Abstract: Provided are a method and apparatus for generating and accessing metadata in a media file format. The method of generating metadata in a media file format includes generating a time-track map composed of a plurality of map nodes that are distinguished according to track and unit time, and generating media objects corresponding to each of the map nodes, in which each of the map nodes includes position information of the corresponding media objects, thereby facilitating real-time reproduction and modification of content.

Abstract: Disclosed herein is parallel processing of a query, which uses inter-query parallelism in posting list intersections. A plurality of tasks, e.g., posting list intersection tasks, are identified for processing in parallel by a plurality of processing units, e.g., a plurality of processing cores of a multi-core system.

Abstract: Disclosed are methods, systems, paradigms and structures for processing data packets in a communication network by a multi-core network processor. The network processor includes a plurality of multi-threaded core processors and special purpose processors for processing the data packets atomically, and in parallel. An ingress module of the network processor stores the incoming data packets in the memory and adds them to an input queue. The network processor processes a data packet by performing a set of network operations on the data packet in a single thread of a core processor. The special purpose processors perform a subset of the set of network operations on the data packet atomically. An egress module retrieves the processed data packets from a plurality of output queues based on a quality of service (QoS) associated with the output queues, and forwards the data packets towards their destination addresses.

Abstract: A system and method for parallel file system traversal using multiple job executors is disclosed. The system includes a pool of job executors, a job queue, and a trigger tracker. An object, representative of a node in the filesystem, is added (i.e., pushed) to the job queue for processing by an job executor. The job queue assigns (i.e., pops) objects to job executors in accordance to a LIFO (Last In First Out) ordering. Then the job executor performs an action such as copy. In one embodiment, the trigger tracker follows the processing of a child nodes to a particular child node. Thus, the filesystem is being traversed by several job executors at the same time.

Abstract: A method for searching a database (206) with stored information using parallel searching of superposition representations of the information. In one approach, the method involves searching a target DNA or RNA genome (16) sequence to determine whether a match is present between a sequence probe and the target. The method includes encoding the target sequence as superpositions of wavefunctions, encoding the probe as one or more wavefunctions, and comparing the encoded target with the encoded probe. The encoding of the target may involve applying a transform (e.g., discrete Fourier transform) to the target sequence to obtain the wavefunctions used to form the one or more superposition representations.

Abstract: Techniques are provided for small file aggregation in a parallel computing system. An exemplary method for storing a plurality of files generated by a plurality of processes in a parallel computing system comprises aggregating the plurality of files into a single aggregated file; and generating metadata for the single aggregated file. The metadata comprises an offset and a length of each of the plurality of files in the single aggregated file. The metadata can be used to unpack one or more of the files from the single aggregated file.

Abstract: When a failure occurs in data matching processing, a quick data backup processing is required. For such an object, the data processing apparatus includes a data distribution part which stores a file data group in a normal data holding area of the j-th matching node and performs a backup processing by dividing the file data included in the file data group in the backup data holding area in the matching nodes other than the j-th matching node. The backup processing is performed by distributing each of the file data in the file data group to the backup data holding area in turn from a least backup data holding area where a file data being currently stored is least among the matching nodes.

Abstract: The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth.

Abstract: The invention provides, in one aspect, an improved system for data access comprising a file server that is coupled to a client device or application executing thereon via one or more networks. The server comprises static storage that is organized in one or more directories, each containing, zero, one or more files. The server also comprises a file system operable, in cooperation with a file system on the client device, to provide authorized applications executing on the client device access to those directories and/or files. Fast file server (FFS) software or other functionality executing on or in connection with the server responds to requests received from the client by transferring requested data to the client device over multiple network pathways. That data can comprise, for example, directory trees, files (or portions thereof), and so forth.

Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.

Abstract: Among other disclosures, a method may include identifying content in an electronic communication, the content including a link. The method may include characterizing content associated with the link and storing the characterization. Upon detecting a match of a characterization, presenting one or more of the communication or portion thereof, the link or content associated with the link.

Abstract: Systems and methods enhance content from one source with content obtained from another source. Information about content, such as content that is or will be experienced by a user, is used to identify the content from another source. The content from the other source may be content of a different type than the content being enhanced. The content from the two (or more) sources are combined and provided simultaneously. The combined content may be provided using a set of one or more electronic devices.

Abstract: The various embodiments herein provide a method and system for modeling a data. The method for modeling data comprises steps of extracting the data from a plurality of data sources, identifying a plurality of entities from the plurality of data, defining occurrence of a relationship between the plurality of entities, capturing recurrences of the relationship between the plurality of entities based on one or more common interactions between the plurality of entities and creating a data model indicating the occurrences and recurrences of the relationship between the plurality of the entities. The data model is adapted to store data corresponding to the plurality of entities, the relationship between the plurality of entities and the common interactions between the plurality of entities. The plurality of entities includes contents of a digital data artifact.

Abstract: A high level programming language provides a co-map communication operator that maps an input indexable type to an output indexable type according to a function. The function maps an index space corresponding to the output indexable type to an index space corresponding to the input indexable type. By doing so, the co-map communication operator lifts a function on an index space to a function on an indexable type to allow composability with other communication operators.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for snapshot isolation support for distributed query processing in a shared disk database cluster are provided. The embodiments include the forming of object identification data in a leader node of query execution in the shared disk database cluster. At least one fragment of the query execution is distributed to at least one worker node in the shared disk database cluster, and the object identification data is utilized for multiversion concurrency control during query execution by the leader node and at least one worker node.

Abstract: A computer readable storage medium includes executable instructions to define a map-reduce document that coordinates processing of data in a distributed database. The map-reduce document complies with a map-reduce specification that integrates map-reduce functions with queries in a query language. The operations specified by the map-reduce document are executed in the distributed database.

Abstract: A random number generation process generated uncorrelated random numbers from identical random number sequences on parallel processing database segments of an MPP database without communications between the segments by establishing a different starting position in the sequence on each segment using an identifier that is unique to each segment, query slice information and the number of segments. A master node dispatches a seed value to initialize the random number sequence generation on all segments, and dispatches the query slice information and information as to the number of segments during a normal query plan dispatch process.

Abstract: Embodiments of the present invention include methods and systems for domain name system (DNS) pre-caching. A method for DNS pre-caching is provided. The method includes receiving uniform resource locator (URL) hostnames for DNS pre-fetch resolution prior to a user hostname request for any of the URL hostnames. The method also includes making a DNS lookup call for at least one of the URL hostnames that are not cached by a DNS cache prior to the user hostname request. The method further includes discarding at least one IP address provided by a DNS resolver for the URL hostnames, wherein a resolution result for at least one of the URL hostnames is cached in the DNS cache in preparation for the user hostname request. A system for DNS pre-caching is provided. The system includes a renderer, an asynchronous DNS pre-fetcher and a hostname table.

Abstract: Techniques for highly parallel evaluation of XACML policies are described herein. In one embodiment, attributes are extracted from a request for accessing a resource including at least one of a user attribute and an environment attribute. Multiple individual searches are concurrently performed, one for each of the extracted attributes, in a policy store having stored therein rules and policies written in XACML, where the rules and policies are optimally stored using a bit vector algorithm. The individual search results associated with the attributes are then combined to generate a single final result using a predetermined policy combination algorithm. It is then determined whether the client is eligible to access the requested resource of the datacenter based on the single final result, including performing a layer-7 access control process, where the network element operates as an application service gateway to the datacenter. Other methods and apparatuses are also described.

Abstract: Specified data is distributed in a High-Performance Computing cluster comprising a Management node and M computation nodes where M is an integer greater than one, by the method comprising: dividing the M computation nodes into m layers where m is an integer greater than one; dividing the specified data into k shares where k is an integer greater than one; distributing, by the Management node, the k shares of data to a first layer of computation nodes as sub-nodes thereof, each node of the first layer obtaining at least one share of data therein; distributing, by each of the computation nodes, the share(s) of data distributed by a parent node thereof to sub-nodes thereof; and requesting, by each of the computation nodes, the remaining specified data to other computation nodes, to thereby obtain all the specified data.

Abstract: A distributed database system has multiple compute nodes each running an instance of a database management system (DBMS) program that accesses database records in a local buffer cache. Records are persistently stored in distributed flash memory on multiple storage nodes. A Sharing Data Fabric (SDF) is a middleware layer between the DBMS programs and the storage nodes and has API functions called by the DBMS programs when a requested record is not present in the local buffer cache. The SDF fetches the requested record from flash memory and loads a copy into the local buffer cache. The SDF has threads on a home storage node that locate database records using a node map. A global cache directory locks and pins records to local buffer caches for updating by a node's DBMS program. DBMS operations are grouped into transactions that are committed or aborted together as a unit.

Abstract: A system and method for providing parallel result streams for database queries is provided. The system includes a network including a client, a server, and a database. The client executes an application and sends a query to the server. In response, the server compiles the query to produce a query plan, executes statements in the query plan and sends parallel result streams to the client.

Abstract: A universal data management interface (UDMI) system includes a processing system generates a visual interface through which a user can access, manage, and manipulate data on plural different types of remote databases. The UDMI connects to multiple standard database management systems and to allow multiple users to access, manage, and manipulate data within each of the multiple standard database management systems. The UDMI also allows multiple virtual databases that reside in a single database to be available as a network service.

Abstract: An improved approach is described for handling parallelization of window functions, particularly window functions that do not contain partition keys or which has low cardinality for the partition keys. The approach is highly scalable and can be used to greatly improve query processing. A two stage evaluation approach is employed to parallelize the processing of window functions. In the first stage, which is highly parallel, the majority of the computation of window function is done by all available processes. In this way, the entire computing power of the database server is utilized. The second stage, which is serial but is likely to be very short, all processes involved in first stage synchronize and complete the window function evaluation.

Abstract: Techniques are disclosed for invoking an analysis routine running on a parallel computer system to analyze query results. A query generated using a query builder application for execution against a database to produce query results. Embodiments receive a selection of one of a plurality of analysis routines to apply to the query results. A command and the query results are transmitted to a compute node of a parallel computer system using an established network connection. Embodiments invoke the selected analysis routine on the parallel computing system using the translated command and the query results to produce analysis routine results. The analysis routine results are merged with the query results to produce merged results, and the merged results are output for display.

Abstract: Cross product/service management of subscriber products/services is provided. When multiple product/services orders or instructions are received for a shared service or resource (e.g., a unified voicemail box/system) from two or more order or instruction entry systems (e.g., wireline and wireless telephone systems), the multiple orders or instructions are passed to a shared product/services provisioning manager for management of the orders or instructions with respect to the shared service or resource. If the orders require a change to the shared service or resource, the orders or instructions are mediated for concurrent or otherwise conflicting requests to the shared service or resource. Mediated requests are formatted for receipt and use by the shared service or resource and are then passed to a network element responsible for the shared service or resource for implementation.

Abstract: The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth.

Abstract: The subject disclosure relates to efficient query processing over large scale data storage. An exemplary process includes retrieving a subset of columns implicated by a query as integer encoded and compressed sequences of values corresponding to different columns of data, defining query processing buckets that span over the subset of columns based on changes of compression type occurring in the integer encoded and compressed sequences of values of the subset of data and processing the query in memory on a bucket by bucket basis and processing the query based on type of current bucket when processing the integer encoded and compressed sequences of values. The column based organization of the data, and the application of a hybrid run length encoding and bit packing technique, enable a highly efficient and speedy query response in real-time.

Abstract: Disclosed are methods, systems, paradigms and structures for processing data packets in a communication network by a multi-core network processor. The network processor includes a plurality of multi-threaded core processors and special purpose processors for processing the data packets atomically, and in parallel. An ingress module of the network processor stores the incoming data packets in the memory and adds them to an input queue. The network processor processes a data packet by performing a set of network operations on the data packet in a single thread of a core processor. The special purpose processors perform a subset of the set of network operations on the data packet atomically. An egress module retrieves the processed data packets from a plurality of output queues based on a quality of service (QoS) associated with the output queues, and forwards the data packets towards their destination addresses.

Abstract: Geocoding architecture based on information retrieval. The geocoding information retrieval system operates on locations and geographic entities. The architecture uses parameters in addition to the query string, if available. The parameters provide contextual information that enables filtering and sorting the results. The additional parameters include market, culture, map view, and user location. A geocoding triage process uses the query and context information provided and output of a machine-learning parser to select the data-lookup geocoders for processing the query. A results processing component collects the results from the underlying data-lookup geocoders, merges the results into a single list after normalizing the scores, and then re-sorts the results list.

Abstract: An interactive computer system and method collects, aggregates and distributes information derived from free-text responses to questions. The system and method collect free-text responses from a subject user and aggregates them with free-text responses from other users. The system and method then uses these free-text responses in learning methodologies (such as temporal spacing) and styles to facilitate long-term learning and knowledge retention.

Abstract: A parallel sorting apparatus is provided whose sorting processing is speeded up. A reference value calculation section calculates a plurality of reference values serving as boundaries of intervals used for allocating input data depending on the magnitude of a value. An input data aggregation section partitions the input data into a plurality of input data regions, and calculates, by parallel processing, mapping information used for allocating data in each of the partitioned input data regions to the plurality of intervals that have boundaries on the reference values calculated by the reference value calculation section. A data allocation section allocates, by parallel processing, data in each of the input data regions to the plurality of intervals in accordance with the mapping information calculated by the input data aggregation section. An interval sorting section individually sorts, by parallel processing, data in the plurality of intervals allocated by the data allocation section.

Abstract: A network-accessible toolbox permits collaborative annotation, facilitating interaction and communication among users. In an implementation, content on a Web page, or other page or document accessible through a network or the Internet, can be annotated. A user can view the page and with the toolbox, select content on the page and make an annotation or suggestion. Multiple users can view and make annotations to the same page at the same time. After annotations are made, users can view the page with annotations made by other users. The author or owner of the page can accept or reject the annotations or suggestions made to the page. If the owner accepts a particular suggestion, the selected content is replaced with the suggestion.

Abstract: A printing system comprised of a printer and a plurality of processing nodes wherein each processing node is disposed for processing a job file associated with a print job into a printer dependent format. The system further comprises a replicator component attached to the job file. The job file includes multiple instances of a raster image processing (RIP) wherein each RIP instance proposes to a collector component an RIP image for printing. The collector grants permission to image a page to a RIP proposal observed to the collector and then rejects the same proposals from other RIP components.

Abstract: Various example embodiments are disclosed. According to an example embodiment, an apparatus may include a plurality of search engine pipeline stages, each of the plurality of search engine pipeline stages being configured to submit a particular search request to a plurality of search engines. The apparatus may also include the plurality of search engines, each of said plurality of search engines being configured to provide search results to one or more of the plurality of search engine pipeline stages.

Abstract: In an embodiment, a method for distributing and processing streams over wide area networks comprises receiving, at a unified data processing node, a continuous query; determining a parallel portion of the continuous query; sending the parallel portion to a plurality of distributed data processing nodes located in a plurality of data centers; at each distributed node in the plurality of distributed nodes, locally executing the parallel portion against independent data partitions, producing a partial summary data, sending the partial summary data to the unified node; continuously receiving, at the unified node, in real-time, the partial summary data.

Abstract: A distributed processing device includes a searching unit that searches, in accordance with attribute names identifying a plurality of records stored on a database, a process group for a second process having as a process target a record of an attribute name different from an attribute name included in a process request of a first process selected from among the process group to the database, a determining unit that determines the first process and the second process as execution targets to be executed by a plurality of nodes when the second process is hit by the searching unit, and an allocation unit that allocates the execution target determined by the determining unit to the plurality of nodes that execute the processes in parallel to the database.

Abstract: Embodiments are directed to implementing custom operators in a query for a parallel query engine and to generating a partitioned representation of a sequence of query operators in a parallel query engine. A computer system receives a portion of partitioned input data at a parallel query engine, where the parallel query engine is configured to process data queries in parallel, and where the queries include a sequence of built-in operators. The computer system incorporates a custom operator into the sequence of built-in operators for a query and accesses the sequence of operators to determine how the partitioned input data is to be processed. The custom operator is accessed in the same manner as the built-in operators. The computer system also processes the sequence of operators including both the built-in operators and at least one custom operator according to the determination indicating how the data is to be processed.

Abstract: A system includes a first site having a first server and a first storage system, a second site including a second server and a second storage system, and a third site coupled to the first and second sites, the third site having gold images. A method of migrating a virtual server image comprises storing a first gold image at the first site; storing a second gold image at the second site; creating a first snapshot volume at the first site based on the first gold image; sending the first gold image ID, update data of the first gold image, and address information for the update data, from the first site to the second site; creating a second snapshot volume at the second site based on the second gold image corresponding to the first gold image ID; allocating storage for storing the update data at the second site with reference to the address information; and storing the update data in the allocated storage.

Abstract: The present invention extends to methods, systems, and computer program products for performing parallel joins on distributed database data. Embodiments of the invention include a phased semi-join reduction strategy using replication and shuffle operations to join a first and a second data source. A filter building phase uses replication and pushes down a “Distinct” (e.g., SQL) operator to produce a list of join keys for the first data source (one side of the join). A shuffle phase for the second data source is modified to join to the key list produced in the first phase as a row filtering mechanism. A join phase then joins the first and second data sources.

Abstract: An approach is provided for presenting search information based on search parameters including a specified search region. Input parameters graphically specifying a search region on an image of a map are received. The input parameters include a height parameter and the search region corresponds to one or more search criteria. A search based on the criteria is caused, at least in part, according to the specified search region to output a search result. Presentation of the search result is caused, at least in part, within the search region.