Abstract: Embodiments relate to a system, method, and device for index compilation to optimize index. Once a CREATE INDEX commands is fired, a first check determines if the user requested has to compile this index. If the index is to be compiled, a corresponding C-file is generated, and a DLL is generated out of the C-file. The DLL is then loaded with server. An INDEX DLL is natively compiled and generated corresponding to each INDEX during definition. The INDEX DLL will contain the required structure and method to perform on INDEX, based on the indexed column data-type.

Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.

Abstract: Disclosed is a mobile station having an expanded storage space, and a method of retrieving a file stored in a remote storage server. The method may include determining whether the file is locally stored or remotely stored, deleting files in a local storage to provide space if the file is determined to reside in a remote storage server, downloading the file from a remote storage server over the Internet by prefetching a portion of the file from the remote storage server, and opening the prefetched portion of the file while concurrently downloading a remaining portion of the file from the remote storage server.

Abstract: A method of optimizing query execution by associating functions with columns includes receiving, by a query optimization server, data definition statement including information of one or more columns and function information for each of the one or more columns. The query optimization server associates the columns having the function information with corresponding predefined functions and stores in a memory. Upon receiving a query comprising a function associated to a column, the query optimization server compares the function with predefined functions stored in the memory. The query optimization server accesses the predefined function from the memory for executing the query based on the comparison.

Abstract: Embodiments relate to a system, method, and device for index compilation to optimize index. Once a CREATE INDEX commands is fired, a first check determines if the user requested has to compile this index. If the index is to be compiled, a corresponding C-file is generated, and a DLL is generated out of the C-file. The DLL is then loaded with server. An INDEX DLL is natively compiled and generated corresponding to each INDEX during definition. The INDEX DLL will contain the required structure and method to perform on INDEX, based on the indexed column data-type.

Abstract: An apparatus and method for creating user defined variable size tags on records in relational database management systems (RDBMS)are disclosed. When creating a table, one of the columns may be created as a new data-type called a “TAG” data-type. The new data-type called “TAG” is used to store various values for a single column against the single record.

Abstract: A system and method to optimize queries on a view comprise a processor coupled to a memory storing a plurality of instructions for directing the processor to receive a query comprising a part of query on view, check, based on the part of query on view, in system table, wherein the system table comprises a status associated with the view indicating the compilation of the view, and if the part of query on view found in the system table, fetch a shared object file storing at least one compilation function associated with the part of query on view, use the compilation function as a part of a query execution plan, and execute the query execution plan to display the result.

Abstract: A method for optimizing query execution comprises receiving one or more optimizing parameters from a user device for optimizing a query execution plan. The one or more optimizing parameters comprise at least one of a query statement, a planning time and a plan execution time. The one or more optimizing parameters are received when duration of execution of the one or more queries using the query execution plan is greater than a predefined time period required for executing the one or more queries. The query execution plan is latest of one or more query execution plans for executing one or more queries. The method comprises generating an optimized query execution plan by iterating optimization of the query execution plan until the optimization satisfies the one or more optimizing parameters.

Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.

Abstract: A method and system for automatic management of dynamically allocated memory in a computer where the system comprises one or more client machines, a communication network and a computer. The one or more users provide one or more queries to access data from the computer and the client machines send the received queries to the computer through the communication network. The processor configured in the computer creates a heap record upon identifying the received queries to be at least one INSERT, DELETE and first type of UPDATE. The heap record is stored in data segment of the one or more databases and when the received queries is second type of UPDATE, the processor creates an undo record and stores the undo record in undo segment of the databases.

Abstract: An example of a method includes determining features of a first type for a web page of a plurality of web pages. The method also includes electronically determining a plurality of rules for an attribute of the first web page, wherein the plurality of rules are determined based on features of the first type. The method also includes electronically identifying a first rule, from the plurality of rules, which satisfies a first predefined criterion. The first predefined criteria include at least one of a first threshold for a precision parameter, a second threshold for a support parameter, a third threshold for a distance parameter and a fourth threshold for a recall parameter. The method further includes storing the first rule to enable extraction of value of the attribute from a second web page.

Abstract: Disclosed is a mobile station having an expanded storage space, and a method of retrieving a file stored in a remote storage server. The method may include determining whether the file is locally stored or remotely stored, deleting files in a local storage to provide space if the file is determined to reside in a remote storage server, downloading the file from a remote storage server over the Internet by prefetching a portion of the file from the remote storage server, and opening the prefetched portion of the file while concurrently downloading a remaining portion of the file from the remote storage server.

Abstract: Disclosed is a mobile station having an expanded storage space, and a method of retrieving a file stored in a remote storage server. The method may include determining whether the file is locally stored or remotely stored, deleting files in a local storage to provide space if the file is determined to reside in a remote storage server, downloading the file from a remote storage server over the Internet by prefetching a portion of the file from the remote storage server, and opening the prefetched portion of the file while concurrently downloading a remaining portion of the file from the remote storage server.

Abstract: A method includes determining, using a processor, a set of aggregate queries to be executed on a data stream, the set of aggregate queries comprising queries that perform respective sets of aggregation operations on respective sets of attribute values over respective time intervals. The method also includes generating, using the processor, at least one intermediate aggregate query for a subset of the set of aggregate queries, the at least one intermediate aggregate query combining a subset of aggregation operations for the subset of aggregate queries and a subset of attribute values. The method further includes executing, using the processor, the at least one intermediate aggregate query to generate pre-aggregated data from the data stream for the subset of aggregate queries and executing, using the processor, the subset of aggregate queries subsequent to executing the at least one intermediate aggregate query on the pre-aggregated data.

Abstract: Improved techniques are disclosed for processing data stream queries wherein a data stream is obtained, a set of aggregate queries to be executed on the data stream is obtained, and a query plan for executing the set of aggregate queries on the data stream is generated. In a first method, the generated query plan includes generating at least one intermediate aggregate query, wherein the intermediate aggregate query combines a subset of aggregate queries from the set of aggregate queries so as to pre-aggregate data from the data stream prior to execution of the subset of aggregate queries such that the generated query plan is optimized for computational expense based on a given cost model. In a second method, the generated query plan includes identifying similar filters in two or more aggregate queries of the set of aggregate queries and combining the similar filters into a single filter such that the single filter is usable to pre-filter data input to the two or more aggregate queries.

Abstract: A method includes determining, using a processor, a set of aggregate queries to be executed on a data stream, the set of aggregate queries comprising queries that perform respective sets of aggregation operations on respective sets of attribute values over respective time intervals. The method also includes generating, using the processor, at least one intermediate aggregate query for a subset of the set of aggregate queries, the at least one intermediate aggregate query combining a subset of aggregation operations for the subset of aggregate queries and a subset of attribute values. The method further includes executing, using the processor, the at least one intermediate aggregate query to generate pre-aggregated data from the data stream for the subset of aggregate queries and executing, using the processor, the subset of aggregate queries subsequent to executing the at least one intermediate aggregate query on the pre-aggregated data.

Abstract: Web pages are efficiently categorized in a data processor without analyzing the content of the web pages. According to at least one embodiment, data is maintained that represents sample URLs grouped into a plurality of clusters. The sample URLs of a cluster are used to produce a URL regular expression pattern (“URL-regex”) that differentiates the sample URLs of the cluster from the sample URLs of other clusters and that covers at least a specified percentage of the sample URLs in the cluster. The process of producing a URL-regex is repeated for each of the clusters producing a URL-regex for each cluster. Web pages are then categorized into one of the clusters by determining which of the URL-regex patterns produced for the clusters match URLs that refer to the web pages. Thus, a web page may be categorized based on a URL that refers to the web page without having to obtain and analyze the content of the web page.

Abstract: A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.

Abstract: A method includes generating, electronically, one or more matching patterns for one or more pairs of attribute values. Each pair includes two attribute values. The two attribute values include a first attribute value from a first record and a second attribute value from a second record. The first attribute value and the second attribute value satisfy a first criterion. Further, the method includes identifying, electronically, matching segment between the first attribute value and the second attribute value of a first pair. The method also includes repeating identifying for each pair. Moreover, the method includes computing a similarity score for the first pair using one of the first pair and the matching segment based on the one or more matching patterns and matching segments of the one or more pairs satisfying a second criterion. The method also includes repeating computing for each pair.

Abstract: A number of configuration elements are associated with a number of devices. Information about input configuration elements is accessed. An input configuration element is associated with one or more input rules. It is determined which of the configuration elements could be accessed by the input rules and any call chains emanating from the rules. Output rules are determined by using the accessed configuration elements, the input rules, and the way the input rule manipulates its accessed configuration elements. Each output rule may be derived from an input rule and corresponds to the same input configuration element associated with that input rule. An executable module is generated that is adapted to access at least a given one of the input configuration elements and to trigger one or more of the output rules corresponding to the given input configuration element.