Abstract: This disclosure relates to a method, article of manufacture, and apparatus for backing up data. In some embodiments, this includes obtaining a root component, wherein the root component is associated with a first GUID, a first display name, and a first type, obtaining components associated with the root component, identifying qualifying components from the components, storing the qualifying components in a structure, at each invocation of a procedure processing each of the qualifying components, obtaining subcomponents associated with a qualifying component, identifying qualifying subcomponents from the subcomponents, storing the qualifying subcomponents in the structure, and determining whether the subcomponents have been processed, and if the subcomponents have not been processed, recursively invoking the procedure.

Abstract: Metadata associated with a first multimedia object in a first medium is used to find a second multimedia object in a second medium. The metadata includes category data.

Abstract: An approach for specifying data in a standards style pattern of Service-Oriented Architecture (SOA) environments is provided. The approach implemented in a computer infrastructure, includes defining an interface including one or more local data elements and one or more references to one or more common data elements, of a service, the one or more common data elements being defined in a library for a plurality of services. The approach further includes configuring a data definition file (DDF) which indicates whether each of the one or more local data elements and the one or more common data elements is mandatory for the service. The approach further includes validating one or more data elements from a consumer as mandatory for the service based on the configured DDF.

Abstract: An interface is provided on a computing device for interacting with data stored in a data repository. Input is received including information identifying two or more attributes, and information indicating an order for the identified attributes. A hierarchical data structure is stored, with an order of hierarchy levels corresponding to the indicated order. Multiple attribute values for the attributes are determined. The method includes assigning to each node of a first level at least one of the attribute values of a first attribute, and assigning to each node of a second level at least one of the attribute values of a second attribute, each of the nodes of the second level also being assigned respective ones of the attribute values assigned to one or more nodes of preceding levels. The interface is displayed including displaying interface elements associated with each of the nodes.

Abstract: In a business where a database tracks customers and manages customer accounts, a method and system correctly link accounts with customers. The method entails reading customer information for a first customer and for a second customer, and then utilizing personal identification information obtained from other sources to determine if the first customer is the same as the second customer. If the first customer and the second customer are the same person, the first customer and the second customer are identified as being the same unique person. Accounts associated with the two customers are identified as belonging to the same unique person. Viewed another way, the method and system of the present invention takes an existing database of personal identification information, and cross-references that database against other sources of personal identification information to identify persons who appear to be separate persons, but who are actually one and the same individual.

Abstract: A system, computer-readable storage medium storing at least one program, and a computer-implemented method for presenting media content information to a user is disclosed. A media search query is received from a user at a client device. A media content query is sent to a media information database. The media content query is at least partially based on the media search query. Media content information is received from the media information database. The information is associated with a plurality of content instances selected from a plurality of content types. The content instances satisfy the media search query and are selected only from content sources accessible to the client device. The media content information is presented to the user of the client device.

Abstract: Systems, methods, and other embodiments associated with virtual masked databases are described. One example system includes a masking logic to mask an unmasked column of a database table to produce a masked column. The masked column is then added to the database creating a bi-masked database. A portion of the bi-masked database is then selected by a view logic and provided to a user. The view provided to the user may allow fast, conflict free queries and updates to the database. By providing the user either masked or unmasked data based on information associated with the user, an added layer of data security may be achieved.

Abstract: According to an embodiment of the present invention, a system alters search results to increase traffic at network sites, and comprises a computer system including at least one processor. The system processes a search query including an inquiry to determine corresponding search results and an answer to the inquiry, wherein the search results include one or more network sites and a corresponding description of content. The search results are filtered to remove from view the answer from the description of content for the network sites. The filtered search results are displayed to enable access of the network site having a corresponding description of content indicating the network site contains the answer. Alternatively, the answer is highlighted for readily viewing by the user. Embodiments of the present invention further include a method and computer program product for altering search results in substantially the same manners described above.

Abstract: A computerized-method of synchronizing data among a federation of servers interconnected over a network that has intermittent or low signal transmission bandwidth is provided. Each server in the federation of servers can receive update messages, determines connection status, maintain data catalogs and transmits updates such that nodes in the federation of servers are synchronized.

Abstract: Systems and methods for identifying trending content on one or more domains is presented. In response to receiving a request for trending content on each domain of a set of domain, network activity data corresponding to network activity of a recent period of time is obtained. According to various embodiments, the network activity data corresponds to activity in the immediately previous time period and includes any of query logs from one or more search engines, social data from one or more social network sites, and browsing data corresponding to the browsing history of a plurality of computer users. Trending content from the network activity data for each domain of the set of domains is identified and the identified content is returned in response to the received request.

Abstract: A search engine is operable to receive keyword information and semantic information that gives meaning and context to the keyword information. The search engine searches a keyword database with the keyword information to determine a set of links to web pages. The search engine also searches a semantic database with the semantic information, and ranks the set of web links based on the search.

Abstract: A method for implementing adaptive merging in database indexes includes selecting a key range from a database query having a range predicate and searching a database for data matching the key range. The data matching the key range is merged to form a collected dataset which is stored for future retrieval. A method for optimizing B-tree representation of a database using actual queries is also provided.

Abstract: A document search system includes a plurality of computers in a network having a router, and an email software program on each of the computers. A database stores attachment files and email documents. A search program on at least one of the computers initiating storage of email documents and attachment files. A mail journal database stores email data extracted by the search program from the email. A message identification (ID) identifying the email document, and the ID being generated by the search program and associating an email document with corresponding email data, and the ID associating the email document with an attachment file when an attachment file is sent. A file loader replacing an attachment file with a file link and storing the attachment file in the database. The file link provides access to the attachment file in the database.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for creating, exporting, viewing and testing, and importing custom applications in a multitenant database environment. These mechanisms and methods can enable embodiments to provide a vehicle for sharing applications across organizational boundaries. The ability to share applications across organizational boundaries can enable tenants in a multi-tenant database system, for example, to easily and efficiently import and export, and thus share, applications with other tenants in the multi-tenant environment.

Abstract: Embodiments of the present invention provide an approach for goal-based user matching among social networking environments. In a typical embodiment, a querying user is asked to respond to a series of questions related to goals, criteria, and criteria priorities (and, optionally, a desired “degree” of separation among other users). The querying user will submit his/her responses, which are then parsed and prioritized accordingly. Based on the responses, social networking sites are then searched to identify a set (e.g., at least one) of candidate users that are potential collaboration partners with the querying user. This set of candidate users may be arranged in a list and sorted according to a best match to the querying user's responses. The list can then be provided to the querying user. In addition, invites can be sent to the set of candidate users to invite such users to connect/collaborate with the querying user.

Abstract: Systems and methods generate a business process control chart and process report card. A method includes generating process control chart data for a building process. The method further includes generating a summary record of sample data from the control chart data. The method includes determining a process grade for each process using the summary record. The method further includes generating a process report card including the determined process grade for each process.

Abstract: Embodiments relating to a computer-implemented process, an apparatus and a computer program product is provided for crawling rich Internet applications. In one aspect the method includes executing an event in a set of events discovered in a state exploration phase according to a predetermined priority of events in each set of events in the sets of events discovered, wherein the event from a higher priority is exhausted before an event from a lower priority is executed and determining any transitions. Responsive to a determination that there are at least one transition any remaining set of events is executed in a transition exploration phase. In addition the method determines the existence of any new states as a result of executing an event in the set of events and returns to the state exploration phase, responsive to a determination that a new state exists.

Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.

Abstract: Technology is disclosed for discovering décor harmonized with a décor style (“the technology”). The décor includes décor items, e.g. artworks, paintings, pictures, artifacts, architectural pieces, arrangement of artworks, color selection, room décor, rugs, mats, furnishings, household items, fashion, clothes, jewelry, car interiors, garden arrangements etc. The technology facilitates analyzing user input to identify a décor style from a décor style dictionary, obtaining décor that harmonizes with décor style, and presenting a representation of the décor to the user. The décor style dictionary includes décor styles that are generated based on an analysis of content, including images and description of décor, from a plurality of sources. The décor styles can be based on a number of concepts, including a theme of the décor, a color/color palette, a mood of the person, a fashion era, a type of architecture, etc.

Abstract: An approach to compression of a large (n point or samples) data set has a combination of one or more desirable technical properties: for a desired level of accuracy (?), the number of compressed points (a “coreset”) representing the original data is O(log n); the level of accuracy comprises a guaranteed bound expressed as multiple of error of an associated line simplification of the data set; for a desired level of accuracy and a complexity (e.g., number k of optimal line segments) of the associated line simplification, the computation time is O(n); and for a desired level of accuracy (c) and a complexity of the associated line simplification, the storage required for the computation is O(log n).