Abstract: A system for automatically managing information privacy includes an input system for receiving a request that includes a call for information in a bean and a purpose for the call, which indicates a manner an information requestor intends to use the information, wherein the call is to a method within the bean referencing at least one privacy control rule, which governs access and/or use of the information, that is packaged with the bean, the privacy control rule being additional to the information and methods of the bean and being packaged as an element of a deployment descriptor; and a privacy control system for automatically determining whether the request should be granted by comparing the purpose to the at least one privacy control rule to determine whether the purpose is valid, wherein the request is granted if the purpose complies with the at least one privacy control rule.

Abstract: Optimization constraints are used to select an appropriate content item from an available group of content items which are ordered in a specific manner to facilitate the proper selection of the content item, even if the exact item desired is not present. The server is then able to insert the selected content item into the outgoing content page requested by the client. The optimization constraints can be, but are not limited to, anyone of the following: communication channel performance (bandwidth), client operating system, client processor, client display capabilities, client installed software (video or audio codecs for example), and/or user preferences. A software product and method enable selective delivery of content to client devices of varying performance characteristics, including varying bandwidth, by selective filtering and inclusion of markup language content using tags demarcating optional content. An optimization constraint is used to select one of the items.

Abstract: One embodiment of the present invention sets forth a technique for efficiently performing a radix sort operation on a graphics processing unit (GPU). The radix sort operation is conducted on an input list of data using one or more passes of a series of three processing phases. In each processing phase, thread groups are each associated with one segment of input data. In the first phase, occurrences of each radix symbol are counted and stored in a list of counters. In the second phase, the list of counters is processed by a parallel prefix sum operation to generate a list of offsets. In the third phase, the list of offsets is used to perform re-ordering on the list of data, according to the current radix symbol. To maintain sort stability, the one or more passes proceed from least significant data to most significant data in the sort key.

Abstract: Systems, methods, and computer-readable media for identifying executable scenario solutions relevant to a user query and returning such executable scenario solutions as search results in response to the user query are provided. Upon receiving a user query, a plurality of results is returned, each result being representative of a series of steps which may be implemented to address a particular issue relevant to the received user query. Often, a series of steps or scenario includes a number of sub-scenarios, each of which is to be executed sequentially to achieve the desired result. Accordingly, upon selection of a particular search result, the user may be guided through a series of sub-scenario result options until an item having direct association to a series of steps is selected. Once selected, the executable scenario solution is presented to the user for execution.

Abstract: Embodiments of the invention provide techniques for searching for virtual objects of an immersive virtual environment based on user interactions within the virtual environment. Generally, embodiments provide an attribute index storing data describing attributes of virtual objects, and an interaction index storing data describing user interactions with virtual objects. Search queries may be evaluated using both the attribute index and interactions index. Thus, virtual objects may be searched in terms of object attributes as well as user interactions with the virtual objects.

Abstract: A system processes user queries. The system may generate a list of query patterns of a first type. The system may also receive a user query and determine whether the received query is a query of the first type based at least in part on the list of query patterns.

Abstract: A method and apparatus are provided for generating a document preview. According to the method, a preview handler provides an interface to one or more previewers. The previewers are software components capable of generating a visual preview for one or more document types. In response to a request from a host application to generate a preview for a document, the preview handler is operative to identify the appropriate previewer for generating a preview for the document. The preview handler may then call the previewer and instruct the previewer to load the document and to show the preview in a sub-window of a window provided by the calling host application.

Abstract: Novel methods for expressing paths contained in queries are provided. The path expressions are composed from tokens selected from the group consisting of object identifiers, attribute identifiers, a relationship operator, and path qualifiers. Path expressions can be more easily created than by creating the path expressions directly in SQL. The path expressions can easily be incorporated into queries for querying data structured according to an object model. Examples of such queries include queries for implementing rules for checking data corresponding to IT infrastructures to see if the IT infrastructure is compliant with policies created for the IT infrastructure.

Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.

Abstract: Apparatus and a method that control the number of sponsored links that are presented in search result webpages in response to a search string presented by a user, based on the past behavior of users to presentations of result in response to the same search string. When this past behavior indicates that users tend to select sponsored links, the number of sponsored links in the results sent to the user is increased, thereby a more responsive presentation. In addition to sending results with a controlled number of sponsored links, the apparatus and the method account for the response of the user so as to include the user's behavior in the information about past behavior of users.

Abstract: A method for normalizing query words in web search includes populating a dictionary with join and split candidates and corresponding joined and split words from an aggregate of query logs; determining a confidence score for join and split candidates, a highest confidence score for each being characterized in the dictionary as must-join and must-split, respectively; accepting queries with words amenable to being split or joined, or amenable to an addition or deletion of a hyphen or an apostrophe; generating, based on the accepted queries, split candidates obtained from the dictionary, and candidates of join, hyphen, or apostrophe algorithmically; and submitting to a search engine the generated possible candidates characterized as must-join or must-split in the dictionary, to improve search results returned in response to the queries; applying a language dictionary to generated candidates not characterized as must-split or must-join, to rank them, and submitting those highest-ranked to the search engine.

Abstract: A map distribution system includes a map distribution server that distributes map data to a navigation device. The server includes a first table having entries that each include update data in correspondence with an ID for the update data and an ID for each other update data upon which the update data depends, a second table having entries that each include an area ID of an area of the map data in correspondence with a version of the area and the ID for each update data that is applied in the version of the area, and an update manager that refers to the second table to select the ID for each update data required for updating an area selected based on input from the navigation device and the required ID for each other update data upon which any update data required for updating the area selected depends.

Abstract: A method and system for performing logical partial declustering in a shared-nothing database environment. The solution defines a partial declustering technique that can be used to dynamically adapt the declustering of base tables or intermediate result sets. The partial declustering technique is defined to limit the number of partitions (P) involved in an operation. The technique is defined to limit the operation to a subset of the system partitioning map (SPM). There are two components: the association between the data values and partitions is altered by restricting the data values to P? partition values where P? is less than P; and the actual partitions of the SPM selected are then derived based on a seed derived from a dynamic parameter, such as a session number, or a static parameter, such as a table identifier. In the case of intermediate result sets the number of P? partitions selected is a cost based decision based on the estimated number of rows in the input intermediate result sets.

Abstract: The present invention, generally speaking, provides a broad-based solution for acquisition, processing and distribution of media objects including pictures (images), movies, videos, graphics, sound clips, etc via the Internet or the like. And specifically, it is a solution to such systems for use in applications wherein there are multiple originators of media objects that will be viewed in multiple web sites having different viewing requirements. A browser-based prepare and post tool prepares and submits media objects from inside a standard browser to a remote server. A Media Acquisition, Processing and Distribution (MAPD) system receives these media objects, processes them to meet specific requirements, and delivers them for integration into remote databases. MAPD system services include media object submission, processing, hosting and mirroring. The hosting service delivers a media object URL to a remote database, allowing the media object to be requested and served by the media object server.

Abstract: A method of computing a measure of similarity between nodes of first and second networks is described. In particular, sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. Thus, a pairwise score, referred to as Rij, is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The goal of this process is to identify node pairs that exhibit high Rij values. According to the technique described herein, the intuition is that nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of “network similarity.” If node feature data also is available, the intuition may be expanded such that nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Node feature data typically is domain-specific.

Abstract: A system, method and computer program product are provided for analyzing network traffic associated with network services. Initially, network traffic and metadata are collected from a network. Thereafter, the network traffic is analyzed utilizing the metadata.

Abstract: Exemplary systems and methods for server management are provided. An exemplary system comprises a plurality of servers, with each server having the ability to access a database or, in some embodiments, be configured to perform a calculation, computation or make a determination of a particular value, values or other information. A communications network delivers queries to each server whereby a look-up table directs query processing by the servers. Further embodiments of the system feature a program logic controller for rebalancing the workload of the network servers. Exemplary methods of processing queries on the system comprise submitting a query to the network, communicating the query to each server in the network and each server looking-up on a look-up table the processing responsibilities of the servers in the network. The query is processed by the server having primary responsibility for processing the query while other the servers monitor query processing.

Abstract: A system may include a routines repository that is configured to store and maintain hardware libraries, software libraries and metadata, a hybrid query engine that may be configured to receive a query, parse the query, compute a query execution plan and output the query execution plan using metadata and operators from the hardware libraries and/or the software libraries, and a routines management module that may be configured to provide the metadata and the operators from the routines repository to the hybrid query engine. The system may include an execution engine module that may be configured to receive the query execution plan, the execution engine module including a reconfigurable hardware execution engine having a reconfigurable fabric, where the reconfigurable hardware execution engine may be configured to process the query execution plan.

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: Implementation of append mode concurrent insert operations in tables in a page-based concurrent relational database management system is carried out by defining a set of last pages as a current cache into which rows may be inserted by appenders. Append mode insert operations for each page in the current cache are serialized. Appenders seek to access the pages in the current cache using a two-pass process in which latches are sought to be acquired conditionally in the first pass and unconditionally in the second pass. A shared data structure is provided to define a current cache and a next cache for a table supporting append mode inserts in the relational database. The shared data structure includes information reflecting the unused space for each page in the current cache.

Abstract: In a relational database system, data is logically represented as a single table, but physically stored as a plurality of overlapping partitions. In some embodiments, the table is created by an instruction defining the table's structure and specifying a plurality of partitions in which to store duplicate copies of some data and in some embodiments, the table is accessed without referencing the overlapping partitions.

Abstract: Computer implemented methods and systems are provided for web log filtering. A uniform resource locator (URL) is identified for a resource requested by an identified device. The URL is stored unless the URL has at a reference to an advertisement or an extension that matches any of a list of extensions specified for storage exclusion. The stored URL is categorized based on either the stored URL or an included domain name, depending on whether the included domain name matches any of the list of domain names that are associated with multiple categories. A count is incremented in a web log category associated with the identified device based on the categorized stored URL.

Abstract: A method and apparatus assigns a quantative variable to each object (or set of objects) in a collection available to a user. The quantative variable is referred to as the Interest Priority Value (IPV). The IPV defines a range of states of the object, between ‘accessed’ and ‘unaccessed’, and is calculated based on one or more attributes of the object. A object with the highest IPV is the most ‘unaccessed,’ and the object with the lowest IPV is the least ‘unaccessed.’ The IPV may be used in a visual representation of the collection of objects, thereby permitting a user to readily identify and obtain those objects of greatest interest to the particular user.

Abstract: Various embodiments of a system and method for detecting trends in network-based content, such as trends within the content of various network locations, are described. The system and method for detecting trends in network-based content may include a network-based trend service that enables a user to create a trend profile. The trend profile may include, a search target, a sampling frequency or schedule, and/or one or more thresholds. To determine the level of network-based activity for a search target, the network-based trend service may determine which network locations of a search domain contain the search target. The network-based trend service may determine the number of instances of the search target found within each search result. The network-based trend service may capture data samples that may include the total number of search results and/or the total instance count and may determine one or more trends from the data samples.

Abstract: Techniques are provided for delaying evaluation of expensive expressions in a query. Expensive expressions in the query are established by cost information or by looking up a list of known expensive expressions for a match. After an execution plan is determined by using the early evaluation technique, one or more equivalent execution plans is established. The one or more equivalent execution plans may include both a type of execution plans that delay evaluation of expensive expressions and a type of execution plans that do not. In addition, the one or more equivalent execution plans may include both parallelized and non-parallelized alternatives to the execution plan identified by the early evaluation technique. Finally, based on a set of criteria, which may include comparing cost information among all the equivalent execution plans generated thus far, the best execution plan is chosen for the query.

Abstract: A campaign management system manages campaign data for one or more campaigns and geospatial data for areas in which the campaigns are directed. The system performs spatial queries, data queries, and/or geocode-based queries, generates maps geographically identifying where campaign events are occurring in the geographic area, and generates feature data for display. Campaign symbology, such as shading, color coding, patterns, icons, or other symbols identify one or more campaign events in the geographic area.

Abstract: A method and system for filing electronic mails is disclosed. The method executed on the client side of a mail application allows to propose to a user a list of relevant folders that have been previously used to store e-mails in relation with the current e-mail to be stored. The relationship between the e-mail is determined by analyzing the content of different message fields of the e-mail header.

Abstract: A method includes receiving information identifying a plurality of selections made by a user. The method also includes updating a help index value based on one or more of the selections. The method further includes detecting a request for help from the user. In addition, the method includes retrieving help information using the help index value and presenting the retrieved help information to the user. At least one of the selections by the user may include a selection of an option from a plurality of options, where each of the options is associated with a different incremental value. Updating the help index value may include adding the incremental value associated with the selected option to the help index value.

Abstract: Enhancing queries for information retrieval that automatically finds the preferred, first ranked matching term usage subject area (“TUSA”) from a prior query. The process automatically finds alternative TUSAs for the prior query, ranked by degree of match or preference, and provides an option to switch among the alternative TUSAs. It is required that a TUSA for the query be passively accepted or actively selected from a presented list based on the prior query. Using means prepared in advance from data sets of messages collected for each TUSA and general vocabulary the process also ranks and presents to the user alternative and additional query terms and phrases reflecting specificity and relevance to the query and the TUSA. Significantly relevant terms and phrases are presented for query refinement and ranked by relevance permitting the user to select and deselect query terms and effect a new search based on the enhanced query.

Abstract: In an information retrieval method a meta search engine receives a user information query in the form of key words; and submits the query to a search engine, and also submits the query to a snippet database storing previously selected results, indexed by a snippet index of terms included in snippets of the results when they were previously selected. The meta search engine then receives results from the search engine; and receives a response from the snippet database. It merges the results from the search engine with those from the snippet database; and submits re-ranked results to the user. The snippet database processes in parallel with the underlying search engine. The meta search engine also monitors which results of the returned re-ranked results are selected by the user, and updates the snippet index accordingly.

Abstract: A data mapping document design system provides a market differentiator that facilitates creating the technical specification for migrating legacy databases. The system addresses the significant technical problems associated with the immensely labor intensive, complex, and error prone endeavor of manually creating the technical specification. The system not only achieves cost and time savings in clearly measurable aspects of data migration such as migration project cost and completion timelines, but also achieves improvements in other harder to measure and track areas, such as data quality, and achieves reductions in subsequently discovered data errors.

Abstract: A database system providing encrypted column data support with decrypt default functionality. In a database system, a method providing automated encryption support for column data comprises steps of: defining Structured Query Language (SQL) extensions for creating and managing column encryption keys and database tables with encrypted column data; receiving an SQL statement specifying creation of a column encryption key; receiving an SQL statement specifying creation of a database table having particular column data encrypted with the column encryption key; receiving an SQL statement specifying a default value to be provided in response to requests for the column data without decrypt permission; in response to a subsequent database operation requesting encrypted column data from a user with decrypt permission, automatically decrypting the column data; and in response to a subsequent database operation requesting the encrypted column data from a user without decrypt permission, returning the default value.

Abstract: A method and apparatus for creating a lineage for a data field is disclosed. The method may include creating a unique identifier for a data field. Also, a record of the origin of data is created when the data is inserted into the data field; however this is not required. The record of the origin of data is associated with the unique identifier for the data field. The lineage for a data field may be viewed. In so doing, the transformations to the data field may be shown.

Abstract: A storage device implements a file profiling mechanism to minimize fragmentation. A plurality of files is organized according to a high or low read/write access frequency. A plurality of unchanging file types are placed in a first grouping. A plurality of oscillating file types are placed in a second grouping adjacent to the first grouping. A plurality of the high frequency read/write access files which are growing file types are placed in a third grouping adjacent to the second grouping. A remainder of the growing file types not placed in the third grouping is defragmented. The remainder of the growing file types is then placed in a fourth grouping adjacent to the third grouping.

Abstract: A system and methods for facilitation of enhanced user interactions with metadata corresponding to one or more media files. A number of user interface methods are described and may be used alone or in combination with one another to present an enhanced metadata entry and modification interface to a user. A method of providing for automated step through of media files for metadata entry is described, as well as a method for quickly presenting the user with the most appropriate media sample from which an appropriate metadata entry or modification can be made by the user.

Abstract: The present invention, generally speaking, provides a broad-based solution for acquisition, processing and distribution of media objects including pictures (images), movies, videos, graphics, sound clips, etc via the Internet or the like. And specifically, it is a solution to such systems for use in applications wherein there are multiple originators of media objects that will be viewed in multiple web sites having different viewing requirements. A browser-based Aprepare and post@ tool prepares and submits media objects from inside a standard browser to a remote server. A Media Acquisition, Processing and Distribution (MAPD) system receives these media objects, processes them to meet specific requirements, and delivers them for integration into remote databases. MAPD system services include media object submission, processing, hosting and mirroring. The hosting service delivers a media object URL to a remote database, allowing the media object to be requested and served by the media object server.

Abstract: A database system capable of dynamically creating one or more keys associated with one or more pre-compiled queries includes a plurality of slave nodes that are operable to execute one or more pre-compiled queries. Each of the plurality of slave nodes operates to store one or more usage statistics that relate to the execution of the one or more pre-compiled queries. The system also includes at least one master node that is coupled to each of the plurality of slave nodes. The at least one master node is operable to receive the one or more usage statistics from each of the plurality of slave nodes. Furthermore, the at least one master node is operable to identify, based at least in part on the one or more usage statistics, one or more keys to dynamically create. Moreover, each of the plurality of slave nodes dynamically creates the one or more keys for use in executing the one or more pre-compiled queries.

Abstract: Techniques are described herein that can be used to access entries in a packed table. An unpacked table includes empty and filled elements. Filled elements can be accumulated and included in a packed table. An element in the packed table can be accessed by considering the location the element would have been located in the unpacked table. The location can be used to determine the location of the element in the packed table.

Abstract: An apparatus, a computer program and a computerized method for determining constituent words of a compound word are provided. Constituent words constitute a compound word. When the constituent words comply to split decision criteria then the constituent words can be used in a separate form. The separate form of the constituent words is used in the search to retrieve the related documents from the document collection.

Abstract: A query framework system is provided. The query framework system comprises a query framework service for consuming a query and returning a result set, a provider application programming interface for defining a consistent application programming interface for providers, one or more providers incorporating query processing logic, and a configuration repository for storing the list of the providers in the query framework system and their properties.

Abstract: A method of accessing information from a collection of data includes receiving a query, generating an inverse index of the collection of data and generating results to the query in conjunction with the inverse index.

Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.