Abstract: A method and apparatus for indexing content. The method includes the steps of converting content to one or more context knowledge graphs, identifying one or more knowledgebase triples or entities from the one or more context knowledge graphs, for each knowledgebase triple or entity, identifying one or more knowledgebase variations thereof, and storing the one or more knowledgebase variations as a knowledgebase representation of the content in a reverse index to a non-volatile computer readable storage medium.

Abstract: A computer-implemented method for profiling a web application. A web page containing JavaScript (JS) is crawled. At least a portion of the JS is extracted from the crawled web page. An automated simulation of the extracted JS is executed.

Abstract: A data management apparatus includes a storage device; and a processor that executes a procedure, the procedure including selecting a data group, each data in the data group including one of a plurality of tags, among a plurality of data, compressing the data group into a compressed data group, and storing the compressed data group in the storage device, the stored compressed data group being associated with tagging information which indicates that each data of the data group includes the certain tag.

Abstract: Some embodiments provide a non transitory computer readable medium that stores a program, which when executed by at least one processing unit, defines a federated multidimensional data storage (MDDS) cube. The program includes sets of instructions that define (1) a first data source view (DSV) to derive data from a first data storage in an MDDS system, (2) a set of dimensions to derive data from the first DSV, (3) a second DSV to derive data from a second data storage in the MDDS system, and (4) an MDDS cube to derive data from the set of dimensions and the second DSV.

Abstract: The disclosed embodiments provide a method and system for processing data. During operation, the system obtains a set of records, wherein each of the records comprises one or more metrics and at least one dimension associated with the one or more metrics. Next, the system creates a data segment comprising at least one of a forward index and an inverted index for a column in the records. The system then stores the data segment in network-accessible storage and assigns the data segment to a partition. Finally, the system enables querying of the data segment through a query node associated with the partition.

Abstract: To retrieve a sequence of associated events in log data, a request expression is parsed to retrieve types of dependencies between events which are searched, and the constraints (e.g., keywords) which characterize each event. Based on the parsing results, query components can be formed, expressing the constraints for individual events and interrelations (e.g., time spans) between events. A resultant span query comprising the query components can then be run against an index of events, which encodes a mutual location of associated events in storage.

Abstract: A system, method, and processor readable medium for processing data in a knowledge management system gathers information content and transmits a work request for the information content gathered. The information content may be registered with a K-map and assigned a unique document identifier. A work queue processes the work requests. The processed information may then be transmitted to another work queue for further processing. Further processing may include categorization, full-text indexing, metrics extraction or other process. Control messages may be transmitted to one or more users providing a status of the work request. The information may be analyzed and further indexed. A progress statistics report may be generated for each of the processes performed on the document. The progress statistics may be provided in a record. A shared access to a central data structure representing the metrics history and taxonomy may be provided for all work queues via a CORBA service.

Abstract: A method of generating a data source model may include defining a first interface for a first abstract sub-model of a first sub-model responsive to user input and defining a second interface for a second abstract sub-model of a second sub-model responsive to user input. A connection may be defined between the first interface and the second interface. First and second data source structure may be respectively defined for the first and second sub-models. After defining the first and second data source structures, a unified data source model may be generated including the first and second sub-models and having the respective first and second interfaces of the first and second abstract sub-models, with the first and second sub-models being coupled through the connection defined between the respective first and second interfaces of the first and second abstract sub-models.

Abstract: Methods and systems are described for shared data sets combined with purchased data sets in an on-line services environment. In one embodiment, a method includes, identifying a user, associating the user with data in a shared database, and receiving a purchased dataset from the identified user. The method further includes adding the purchased dataset to a delta table associated with the shared database based on determined record relationships and field relationship, and providing access to the purchased dataset to the user through requests for data in the shared database.

Abstract: The specification and drawings present a new method, apparatus and software related product (e.g., computer readable medium) presented for: reading all multi-application files stored in network devices (i.e., in servers, workstations, archives, backup repositories, etc.) comprised in a computer network or reading selected multi-application files comprising one or more predefined features and stored in said network devices using a generic application programming interface (GAPI), followed by creating and/or updating (e.g., periodically) meta-data for the files read by using the GAPI, and/or followed by retrieving requested files out of the multi-application files using the meta-data for the requested files (if the meta-data is created and properly updated).

Abstract: A method includes identifying a table over a conventional database used by an application, creating a view of the table equivalent to the identified table in an in-memory database, and calling the view with a same call as used for the identified table such that calling the view via the application provides a same result as would have been obtained from the same call to the table in the conventional database.

Abstract: Methods and apparatus to interface an application to a database are disclosed. An example method includes determining a query used by an application that is to communicate with a database via a database driver. The query is tested on the database via the database driver. Such testing includes storing a query template when a received result of the query matches an expected result of the query. A database access framework is generated to interface between the application and the database driver based on the stored query template.

Abstract: A system limits search results based on context information. The system obtains the context information and a search query, and obtains a set of references to documents in response to the search query. The system then filters the set of references based on the context information and presents the filtered set of references to a user.

Abstract: Computerized systems and methods are disclosed for analyzing search query relationships and managing electronic content. In accordance with one implementation, log data pertaining to a plurality of queries may be received over an electronic network. A click graph may be generated representing one or more relationships between the queries. Further, temporal similarities may be identified between the queries, for example, by looking at peaks in frequency of queries over time. A pair of search queries may be evaluated based on the generated click graph and the identified temporal similarities to determine whether the queries in the pair are related.

Abstract: To address problems related to interface differences and disunity among on-line services, such as newsgroups message boards and forums, the present inventors devised systems, methods, and software for automating the posting and retrieval of content across different on-line services as well as encouraging growth of active on-line communities. One exemplary system includes a posting module, a retrieval module, and a web server. The posting module allows users to create and initiate data postings that are sent automatically to several newsgroups, message boards, and/or other on-line information sources. The retrieval module automatically retrieves replies to the postings at each of the on-line sources and presents them through the webserver for user review and further reply, eliminating the need for users to repeatedly visit posting sites in search of reply messages.

Abstract: The present invention discloses a method for implementing electronic bookmarks and a device thereof, wherein, the method for implementing electronic bookmarks includes: detecting an operation on a file; and performing a synchronous operation on the bookmark content of the file according to the operation on the file. The present invention synchronously performs processing on the bookmark content after performing an operation on the file, which can implement that the file can still be opened through the bookmark content even if the file is changed; the transformation of terminals is simple, which can be applied to various types of mobile terminals, thereby improving the usability of the mobile terminals and user experience.

Abstract: Methods, systems, and computer program products are provided for improving the processing of database queries. Some embodiments include detecting an overly long running query execution plan, stopping execution of the plan, and utilizing the query optimizer to select an alternate plan for execution. Embodiments may utilize system timers which are set with a time limit for the first selected plan, with instructions to re-optimize and initiate selection of an alternate plan when the timer times out. Risky constructs may be located in the first plan and removed from future consideration for executing the query. In some embodiments, the additional overhead for non-problem queries consists of little more than creating and sending a message or setting a timer when starting query execution, and canceling a timer upon successful query processing completion. A secondary thread may be created responsive to detecting a long running query, to supervise selecting an alternate execution plan.

Abstract: The disclosure provides a data source searching system and a method adapted for the system. The system includes a number of cloud servers which store data. The system acquires creation time of the data in each cloud server in response to a command for searching data source of the data. A time zone of each cloud server is acquired. The system compares all creation time of the data in all cloud servers based on the time zones to determine which creation time of the data is in fact the earliest among all compared cloud servers and regards the cloud server which stores the data whose creation time is the earliest as the data source of the data.

Abstract: System, method and computer program products for storing data by computing a plurality of hash functions of data values in a data item, and determining a corresponding memory location for one of the plurality of hash functions of data values in the data item. Each memory location is of a cacheline size wherein a data item is stored in a memory location. Each memory location can store a plurality of data items. A key portion of all data items is contiguously stored within the memory location, and a payload portion is contiguously stored within the memory location. Payload portions are packed as bit-aligned in a fixed-sized memory location, comprising a bucket in a bucketized hash table, each bucket sized to store multiple key portions and payload portions that are packed as bit-aligned in a fixed-sized bucket. Corresponding key portions are stored as compressed keys in said fixed-sized bucket.

Abstract: Providing search results is disclosed. A search query is received and a plurality of preprocessing functions to be performed on the search query is determined based at least in part on a search label corresponding to the search query. The plurality of preprocessing functions is performed on the search query to obtain a plurality of preprocessed search queries. Based at least in part on precision levels associated with the plurality of preprocessed search queries, a search plan comprising a selected preprocessed search query is generated. The search plan is input to the search engine to obtain the search results.