Abstract: A method of memory management can include creating an initial root set of pointers for a program during execution of the program and performing a marking process by iteratively marking referred objects of each pointer of the root set and expanding the root set with filtered, encoded pointers. The method also can include identifying each non-live object for any marked object as red-marked and performing, using a processor, a re-marking process on the root set in which red-marked objects are excluded. Each object of the root set not marked can be designated as including a memory leak.

Abstract: A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results.

Abstract: A system may determine metadata information associated with data included in a data structure. The system may identify a category, associated with the data, based on the metadata information. The system may present, for display, a user interface that allows a user to build a graphical query based on the category. The graphical query may include a user-defined visual representation of a data structure query associated with the data. The system may receive information associated with the graphical query based on presenting the user interface. The information associated with the graphical query may be received based on input provided via the user interface, and may include information associated with the category. The system may provide the information associated with the graphical query.

Abstract: In one embodiment, a method includes receiving, from a first user associated with an online social network, a request to view an image associated with the online social network, accessing the image, wherein the image includes multiple tags corresponding to multiple objects, generating an aggregated tag for two or more of the tags based on the proximity of the tags to each other, determining a social-graph affinity for each object in the aggregated tag, and rendering the image with a tag-label for the aggregated tag, where the description in the tag-label is based on the social-graph affinity for the objects associated with the aggregated tag.

Abstract: In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for creating a data silo and testing with a data silo including, for example, initiating a test sequence against a production database within the host organization, in which the test sequence specifies: a) new data for insertion into the production database during the test sequence, and b) one or more test queries against the production database during the test sequence; performing a database transaction to insert the new data into the production database without committing the new data to the production database; recording names of one or more objects corresponding to the inserted new data, the one or more objects created as part of the transaction to insert the new data into the production database within a transaction entity object map; modifying the one or more test queries specified by the test sequence to no longer query against the production database by substituting the one or more test queries with referenc

Abstract: Embodiments are directed towards managing mobile searches by enabling a user to indicate a context of a search query to narrow a scope of the search. A user may fine tune a search by selecting from a plurality of pre-defined contexts for which to perform a search query. In one embodiment, the user may combine two or more pre-defined contexts to create more complex contexts for use in customized context search queries. The user also enters one or more search terms. A subset of databases is selected from a plurality of databases associated with different subject categories. The subset of databases is selected as predefined by an operator based on the user's context, and searched based on the user's entered search terms and selected context. Results are then aggregated and provided to the user. Results may be rank ordered based on the given user context or user's previous search behavior.

Abstract: In one embodiment, the storage system determines if a first format of a first segment tree of the first file system is different from a second format of a second segment tree of the second file system representing a file stored in the first and second file systems, respectively. The storage system identifies, in response to determining that the first and second formats are different, a second level within the first and second segment trees that have different formats. In one embodiment, the storage system further identifies one or more segments of the second level of the first segment tree that have been modified based on a comparison of fingerprints of a third level of the segment trees. For each modified second level segment, the storage system resegments the segment from the first to the second format, and replicates the resegmented segments to the target storage system.

Abstract: Techniques for backing up replicated data are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for backing up replicated data comprising identifying replicated data on a primary node and a secondary node, and determining whether a backup is capable of being performed on the secondary node. In the event a backup is capable of being performed on the secondary node, the method may create a backup copy of the identified replicated data on the secondary node, and in the event a backup is not capable of being performed on the secondary node, the method may create a backup copy of the identified replicated data on the primary node.

Abstract: Methods, systems and techniques for synchronizing content, such as a file, between one or more clients and one or more servers are provided. Example embodiments provide a Cross-File Differential Content Synchronization System (CDCSS) to synchronize files between remote systems in a nearly instantaneous manner without necessitating the transfer of the entire contents of a file. These components cooperate to transfer only the differences in data content wherever possible to a recipient system by providing a patch mechanism that instructs the recipient to build the modified or new data content based upon content it already has access to. In addition, in one embodiment the CDCSS synchronization solution provides a client-based index, rather than a server-based index, for tracking patches and files, which reduces the amount of computational and I/O overhead on the server and which does not require a negotiation between a client and a server to provide an update.

Abstract: An auditing system receives a set of audit rules from a database administrator, which define a search criteria used to identify a database object that is desired to be audited. The auditing system uses the audit rules to search through a database to identify a corresponding set of database objects that satisfy at least one of the set of audit rules. Then, the system generates audit commands that configure a database management system to audit the identified set of database objects.

Abstract: A method and apparatus for accessing, processing and manipulating data in an OLAP database. According to one aspect, the present invention comprises a user interface configured for accessing, processing and manipulating data in an OLAP cube. According to another aspect, the present invention comprises a calculation engine for manipulating and managing data in the OLAP cube.

Abstract: A method for executing on a local user system a body of computer-executable code that resides on a provider system is described. A modified image of the computer executable code is installed to a virtual disk on the local user system, the modified image comprising file structure information. The installing comprises creating each of the local files to the virtual disk with null data, wherein upon installation of the modified image, a plurality of disk blocks assigned to the local files contain a null indicator and do not contain any processable content. A streaming control module senses a request to access the virtual disk, determines whether streaming is indicated to satisfy the request, and transfers to the user system the processable content corresponding to the requested disk block. Streaming is indicated when the request corresponds to one of the disk blocks that does not contain any processable content.

Abstract: Described herein is a technology for facilitating delta data load. In some implementations, history tables corresponding to physical tables in a data source are provided in a database layer. The database layer includes change list tables corresponding to the history tables and a physical data model based on one or more physical tables. Delta data is determined by analyzing the change list table to create delta data summary tables. Key lists are generated for summary tables corresponding to physical tables which physical data is based. The delta data is applied to the physical data model.

Abstract: An association between a set of data and a pre-storage operation is obtained where the set of data is defined in a manner that permits the set of data to include more than one unit of data. In response to receiving data which meets the definition of the set of data, the pre-storage operation is performed on the received data and the output of the pre-storage operation is stored.

Abstract: System and methods for performing context inference in a computing device are disclosed. In one embodiment, a method of performing context inference includes: determining, at a computing device, a first context class using context-related data from at least one data source associated with a mobile device; and determining, at the mobile device, a fusion class based on the first context class, the fusion class being associated with at least one characteristic that is common to the first context class and a second context class that is different from the first context class.

Abstract: A database performance estimation device includes: a unit that switches at least two types of calculation methods according to configuration mode data and performs the switched calculation method to acquire a child block searching time (d) and a leaf block scanning time (s); a unit that switches at least two types of calculation methods according to the configuration mode data and performs the switched calculation method to acquire an entry inserting time (i); and a unit that calculates an average time required for identifying a target leaf block per one manipulation performed to the index block, an average time required for searching for a target entry in the identified leaf block, and an average time required for inserting a target entry in the identified leaf block, and estimates the total of the average times calculated above as an average processing time per one manipulation performed to the index block.

Abstract: Techniques for visual data import into an object model are described. A graphical user interface concurrently displays a first icon that represents a first object type and a second icon that represents a second object type. Input defining object-to-data mappings between properties of the object types and structured data of one or more data sources is received. Further input defining a relationship type for relationships between the first object type and the second object type is also received. In response to the second input, a graphical representation of the relationship type is displayed, visually linking the first icon to the second icon. Based at least on the object-to-data mappings, the definition of the relationship type, and the structured data, an object model is created, comprising first objects of the first object type, second objects of the second object type, and relationships between the first objects and the second objects.

Abstract: Various embodiments provide a search tool that utilizes multiple different search engines. The individual search engines are configured to conduct searches in different ways across a search space that includes different types of data sets. In at least some embodiments, the type of search engine that is utilized is a function of characteristics of the data set(s) that is (are) to be searched. In search spaces that include different types of data sets, combining and mixing different search engines to collectively search the search space can provide a desirably fast and robust user experience.

Abstract: Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents a set of rows that have satisfied one or more conjunctive conditions which preceded a conjunct that is a disjunction in a query expression and restricting evaluation of a disjunct within the disjunction to the set of rows represented by the bitmap. Another embodiment includes determining a satisfaction bitmap, where the bitmap represents the result of one or more preceding disjuncts in a disjunction within a query expression and restricting scope of evaluation of a disjunct to a set of rows that are not within the determined satisfaction bitmap. In this way, embodiments of the present invention enable the acceleration of queries containing disjunctions of conditions on a database table, as well as reduce the temporary resources consumed for such queries.

Abstract: Techniques are disclosed for analyzing a “context window” of a search query to determine a semantic meaning of a search word and to filter search results based upon the semantic meaning. Generally, a lexicon may be used to store forms, meanings, and usages of words and phrases. When a user specifies a query, a semantic analyzer obtains all of the word senses for a search word. The semantic analyzer applies lexical analysis techniques to the search word and context window to obtain a total score for each word sense and selects the word sense with the highest total score. After query results such as documents containing the search words are obtained, the semantic analyzer applies lexical analysis techniques to filter the results so that only documents which use the search terms, according to the selected word sense are returned.