| 14th week of 2014 patent applcation highlights part 54 |
| Patent application number | Title | Published |
|---|
| 20140095448 | AUTOMATED INFORMATION LIFECYCLE MANAGEMENT USING LOW ACCESS PATTERNS - A method, apparatus, and system for automated information lifecycle management using low access patterns in a database management system are provided. A user or the database can store policy data that defines an archiving action when meeting an activity-level condition on one or more database objects. The archiving actions may include compression, data movement, and other actions to place the database object in an appropriate storage tier for a lifecycle phase of the database object. The activity-level condition may specify the database object meeting a low access pattern, optionally for a minimum time period. Various criteria including access statistics for the database object and cost characteristics of current and target compression levels or storage tiers may be considered to determine the meeting of the activity-level condition. The policies may be evaluated on an adjustable periodic basis and may utilize a task scheduler for minimal performance impact. | 2014-04-03 |
| 20140095449 | Policy Driven Data Placement And Information Lifecycle Management - A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions based on access statistics can be specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler. | 2014-04-03 |
| 20140095450 | Custom Policy Driven Data Placement And Information Lifecycle Management - A method, apparatus, and system for custom policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative custom policies that define the movement and transformation of stored database objects. A custom policy defines, for a database object, a custom function to evaluate on an associated database object to determine whether an archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. The custom function is defined by the database user, and can flexibly include any customized business logic using data sources internal and external to the database, including database access statistics such as segment level or block level heatmaps. | 2014-04-03 |
| 20140095451 | SYSTEM AND METHOD FOR MINIMIZING DATA RECOVERY WINDOW - A computer-based system includes a backup server, a production server, a recovery agent that executes on the production server, a database on the production server, a backup database on the backup server, and a meta data file on the backup server. The meta data file includes file names, a file directory, and file attributes. The system is configured to copy the metadata file from the backup server to a production server. When the copying of the metadata file from the backup server to the production server is complete, and before or during a time period in which backup data is copied from the backup server to the production server, the system is configured to receive a request from the production server to restore a file from the backup server with a higher priority than other files on the backup server. | 2014-04-03 |
| 20140095452 | IN PLACE POINT-IN-TIME RECOVERY OF PLUGGABLE DATABASES - In an approach, a database server maintains a container database which comprises: one or more pluggable databases, a root database that stores an undo log for rolling back transactions on the consolidated database, and a redo log for replaying modifications to the container database. The database server restores a particular pluggable with a backup version that corresponds to a first point in time. The database server generates a clone database loaded with a backup version of the root database that corresponds to the first point in time. The database server applies the redo log to recover the particular pluggable database and the clone database to a second point in time that is later than the first point in time. The database server identifies, based on the clone database, one or more active transactions on the particular pluggable database. The database server rolls back the one or more active transactions. | 2014-04-03 |
| 20140095453 | REAL-TIME AUTOMATIC DATABASE DIAGNOSTIC MONITOR - A method for obtaining data items from an unresponsive database host. The method includes receiving an indication that the database host is unresponsive, receiving, from a management server via a diagnostic connection, a first request for a first organized data item, and sending a first query, using a first interface, to a memory for the first organized data item. The method further includes receiving, from the management server via a normal connection, a second request for a second organized data item, retrieving, from memory on the database host, a first data item in response to the first query, converting the first data item into the first organized data item, and sending the first organized data item to the management server, wherein the first organized data item is analyzed to determine a source causing the database host to be unresponsive. | 2014-04-03 |
| 20140095454 | Message Validation in a Service-Oriented Architecture - Message validation in a service-oriented architecture defines a message structure using XML data types. Context-independent validity constraints are specified using an XML schema. Context-specific validity constrains are specified in an intermediary data structure for a specific service operation. A service interface including the XML schema and the intermediary data structure is published. | 2014-04-03 |
| 20140095455 | HEAT INDICES FOR FILE SYSTEMS AND BLOCK STORAGE - Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized. | 2014-04-03 |
| 20140095456 | SYSTEM AND METHOD FOR DOCUMENT VERSION CURATION WITH REDUCED STORAGE REQUIREMENTS - A system and method for curation of document versions with significantly reduced storage requirements. In some embodiments, all or substantially all versions of a document are at least initially retained. Based on various criteria, versions of the document are selectively deleted while preserving the versions that are likely to provide the highest value. Advantageously, the teachings of embodiments as described can be used in conjunction with various systems, including document versioning, deduplication, and retention systems. | 2014-04-03 |
| 20140095457 | REGULATING DATA STORAGE BASED ON POPULARITY - Technology is disclosed for regulating data storage based on a popularity of data files (“the technology”). Various embodiments of the technology includes maintaining a fixed durability level of data files stored in a storage system by regulating a number of copies of the data files stored in the storage system. One embodiment includes regulating the number of copies of a particular data file based on popularity of the particular data file among various users using the storage system. The number of copies stored in the storage system is increased or decreased, including from/to zero, based on the popularity of the particular data file. The popularity is determined based on at least one of: a number of computing devices of various users having the particular data file, a latency, network bandwidth and/or availability with the computing devices for reading the particular data file, or access pattern of the particular data file. | 2014-04-03 |
| 20140095458 | STORAGE DEVICE FOR STORING DIRECTORY ENTRIES, DIRECTORY ENTRY LOOKUP APPARATUS AND METHOD, AND STORAGE MEDIUM STORING DIRECTORY ENTRY LOOKUP PROGRAM - A storage device, a directory entry lookup method for the storage device, and a host running the method can provide a quick directory entry lookup. The host includes an interface for exchanging data with the storage device which stores a multi-level hash table comprising directory entries of each directory, and a file system module receiving a file lookup command designating a target directory and a target filename, calculating a hash value which reflects the target filename and a lookup level, and searching for a directory entry which comprises the target filename in a bucket corresponding to the hash value from among buckets at the lookup level which are included in a multi-level hash table of the target directory. If the search for the directory entry fails, the file system module increases the lookup level and again calculates the hash value and searches for the directory entry for the target filename. | 2014-04-03 |
| 20140095459 | SUPPORTING COORDINATED ACCESS TO A FILE SYSTEM'S SHARED STORAGE USING AUTOMATIC ALIGNMENT OF A PARALLEL FILE ACCESS PROTOCOL AND METADATA MANAGEMENT - Embodiments of the invention relate to supporting coordinated access to a file system's shared disk storage subsystem using an automatic alignment of a parallel file access protocol and metadata management on a per object basis. A file server (among servers in the cluster) receives a client's request to access a file stored by the file system in the storage subsystem using a parallel file access protocol. If the file system has selected a file server to serve as a metadata manager of said file, the file server uses the selected file server to coordinate access to the file's metadata. If the file system has not selected a file server to serve as the metadata manager of the file, the file system selects the file server that received said request as the metadata manager for said file until a file close request operation is received. | 2014-04-03 |
| 20140095460 | Crowdsourcing Viewable Events - Embodiments are disclosed to provide the crowdsourcing of viewable events. Crowdsourcing can be used to determine what is viewable in a particular venue, such as a restaurant, bar, or private home. Information about venues and events is populated in a database by a plurality of users. Events are associated with venues by a crowdsourcing engine. Users wishing to view a particular event can find a venue showing that event through information provided by other users. | 2014-04-03 |
| 20140095461 | COMMUNICATING BOOKMARKED WEBPAGE REQUESTS TO SEARCH ENGINES - Systems, methods, and computer-readable storage media are provided for informing search engines of requests for web pages bookmarked in association with a browser, and permitting such requests to be logged by the search engines as search queries. When a browser receives a request from a user for a bookmarked Uniform Resource Identifier (URI), it is determined whether the user has a search engine preference set as a default. If the user does have a default search engine, the user's request for the bookmarked URI is communicated to the default search engine, permitting the search engine to log the user's request as a search query. In parallel, the requested URI is rendered in association with the user's computing device. | 2014-04-03 |
| 20140095462 | HYBRID EXECUTION OF CONTINUOUS AND SCHEDULED QUERIES - Techniques for implementing the hybrid execution of continuous and scheduled queries are provided. In some examples, a query engine may be initialized with relational data from at least a first source. For example, the first source may include a database or other system that can provide historical data. Additionally, the query engine may be enabled to provide query results based at least in part on the relational data from at least the first source and streaming data from at least a second source. In some examples, the second source may be a data stream. | 2014-04-03 |
| 20140095463 | Product Search Engine - The present invention facilitates product searches on a personal computer, mobile or other device from remote sites via widget lookup using a computed image signature and optional product information extracted using a template in order to retrieve a list of the same or similar products available at other sites. The search starts with a widget lookup process, followed by the submission of the product image URL, optional product information extracted using a site specific product information template and information from HTML attributes to a server. The image signature is computed, a lookup based on the image signature and product information is executed and a product list with an image, price and link to each retailer where the product can be found is returned. The list is reduced based on the submitted image, optional product template and attribute information. The server sends the product list to the user's browser for display. | 2014-04-03 |
| 20140095464 | INFORMATION PROVIDING SYSTEM, INFORMATION PROVIDING DEVICE, INFORMATION PROVIDING METHOD AND PROGRAM - The information providing device comprises a display unit; a first obtaining unit for obtaining the content through the network to to cause the display unit to display the content; an extraction unit for extracting a target phrase for search from the content; a search unit for sequentially searching contents on the network for the phrase to obtain a number of contents hit in a search and numbers of views of the contents; a second obtaining unit for obtaining a content whose number of views is largest when the obtained number of contents is equal to or lower than a given number; and a control unit for extracting a portion of the obtained content as the related information, and causing the display unit to sequentially display the related information in synchronization with a speed at which the user views the content. | 2014-04-03 |
| 20140095465 | METHOD AND APPARATUS FOR DETERMINING RANK OF WEB PAGES BASED UPON PAST CONTENT PORTION SELECTIONS - A method for determining the significance of a web page, or a portion thereof, is disclosed. Accordingly, a search engine or some other application analyzes user-selected content portions (as well as user-provided comments associated with the portions) of a document to determine a document relevance score (e.g. Content Selection Rank) for the document containing the user-selected content portions. The particular algorithm for determining the document relevance score will vary depending upon the particular implementation, but may generally be based upon an analysis of the number and quality of user-selected portions, associated comments, the ratings of the user making the selections and the ratings of users contributing to interactions (such as sharing) with the portions. Based on this analysis, the document is assigned a document relevance score, which is used for processing the document in accordance with instructions associated with a search query. For example, the document relevance score may be used in selecting and ordering documents returned in search results for a particular search query. | 2014-04-03 |
| 20140095466 | ENTITY ASSESSMENT AND RANKING - General entity retrieval and ranking is described. A first set of documents is retrieved from one or more document repositories based on a query formed according to the topic. The first set of documents is characterized based on its first set of metadata values. One or more candidate entities are identified based on the first set of documents and the original query is thereafter augmented according to a candidate entity. The second set of documents resulting from the augmented query is then characterized in a similar manner. For each candidate entity, the first and second document set characterizations are compared to determine their degree of similarity. Increasingly similar document set characterizations indicates that the candidate entity is increasingly relevant to the original query. Repeating this process for each of the one or more candidate entities can give rise to rankings according to the respective degrees of similarity. | 2014-04-03 |
| 20140095467 | METHOD AND SYSTEM FOR MEMORY EFFICIENT, UPDATE OPTIMIZED, TRANSACTIONAL FULL-TEXT INDEX VIEW MAINTENANCE - Methods and systems are directed to an update-optimized and memory-efficient method for transactional full-text index view maintenance. Embodiments include a method and system of reducing the overhead requirements of maintaining a transactional index view in the case of a large number of updates at any particular time. The method involves maintaining a single blacklist bitmap across updated transactional query views, applying the latest set of updates to the bitmap when a new view is required, and post-adjusting the bitmap when the transactional view is created to ensure that entries that should be visible have not been removed. | 2014-04-03 |
| 20140095468 | HARDWARE FOR TABLE SCAN ACCELERATION - Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query. | 2014-04-03 |
| 20140095469 | OPTIMIZATION OF DATABASE QUERY - Described herein is a technology for facilitating optimization of database queries is described herein. In some implementations, a first query is received. At least one scenario for optimization is automatically recognized by detecting specific syntax in the query. A second query is then automatically generated by re-writing the first query using a pre-defined operation corresponding to the recognized scenario. | 2014-04-03 |
| 20140095470 | DATABASE QUERY IN A SHARE-NOTHING DATABASE ARCHITECTURE - Data query in a share-nothing database includes obtaining a query request and generating an optimized access plan with respect to the query request. The query request relates to external data stored in an external data source and contains a definition for expected distribution of the external data. The data query also includes obtaining data distribution information related to the expected distribution based on the optimized access plan, transmitting the data distribution information to the external data source so that the external data source splits and returns the external data in accordance with the data distribution information, and executing query-related processing of the split external data in accordance with the optimized access plan. | 2014-04-03 |
| 20140095471 | JOIN OPERATIONS FOR CONTINUOUS QUERIES OVER ARCHIVED VIEWS - A continuous query may be received, the continuous query being identified based at least in part on an archived view. The archived view may be created and/or identified based at least in part on a join query related to two or more archived relations associated with an application, at least one of the two or more archived relations being identified as a dimension relation. A query plan for the continuous query may be generated. A join operator in the query plan may be identified based at least in part on the dimension relation. A state of an operator corresponding to the dimension relation may be initialized. It may be identified if the state of the operator identifies an event that detects a change to the dimension relation. The continuous query may be re-started based at least in part on the event that detects the change to the dimension relation. | 2014-04-03 |
| 20140095472 | ADAPTIVE QUERY OPTIMIZATION - Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query. | 2014-04-03 |
| 20140095473 | MANAGING CONTINUOUS QUERIES IN THE PRESENCE OF SUBQUERIES - Techniques for managing continuous queries that include subqueries are provided. In some examples, a continuous query that includes at least a subquery may be identified. Additionally, the subquery may be processed to obtain a first result or generate a logical subquery plan. Further, in some instances, the continuous query may then be processed based at least in part on the first result from the subquery or by merging a logical continuous query plan with the logical subquery plan. This may result in obtaining a second result via querying a data source with the continuous query that is based at least in part on the first result from the subquery and/or the merged plans. | 2014-04-03 |
| 20140095474 | CREATING AND USING DATA THAT INDICATES MISESTIMATES OF ACTUAL COSTS - Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query. | 2014-04-03 |
| 20140095475 | TRIGGERING HARD PARSES - Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query. | 2014-04-03 |
| 20140095476 | Database Comparison System and Method - A System and method include receiving a request for data at a programmed computer, the request identifying a field and an operation for an embedded database, translating the request via the programmed computer into multiple requests tailored to schemas of multiple different databases, estimating a cost to execute the request against each of the multiple different databases, and identifying the database that can execute the request with the least cost. | 2014-04-03 |
| 20140095477 | SYSTEM AND METHOD FOR ENHANCING SEARCH EXPERIENCE OF A USER OF A COMMUNICATION DEVICE - Embodiments of the present invention may enable a communication device to search for multiple results from a database by using a single search query. The communication device may include a display screen, a processor, and a memory coupled to the processor. The memory may include a database and an instruction set. The database may store contact information of one or more entities. Further, the instruction set may include instructions executable by the processor to scan a query received from a user to recognize special characters and wild cards in the query. Further, the instructions may divide the query into multiple sub-queries based on the use of the special characters in the query. Furthermore, the instructions may execute and display results of the sub-queries in a user friendly manner. | 2014-04-03 |
| 20140095478 | ESTABLISHING "IS A" RELATIONSHIPS FOR A TAXONOMY - Disclosed are methods for returning to a user an answer to the question “what is .” Concepts and classes to which the concepts belong are determined from a corpus, such as taxonomy. The concepts are mapped to categories according to the structure of the taxonomy. Homonyms for words are collected and scored according to likeliness of use. Concept vectors are assembled for the identified concepts based on articles in the corpus and social media usage. Words are evaluated for generic-ness and a generic score is associated therewith. In responding to a query, the generic-ness of the terms of the query is evaluated and additional context solicited if the terms are generic. Candidate homonym concepts for a string in the query are selected according to context vectors for the homonym concepts. One or more homonym concepts are selected and the one or more categories corresponding to these concepts are returned. | 2014-04-03 |
| 20140095479 | DEVICE, METHOD, AND SYSTEM FOR RECIPE RECOMMENDATION AND RECIPE INGREDIENT MANAGEMENT - A method, device, and system for generating a list of recipe recommendations includes determining the type and quantity of ingredients available to a user of a mobile computing device or smart storage. The available ingredients may be determined using text input or voice input from the user. A camera may also be used to capture images of the available ingredients for analysis. The list of recipes may be generated as a function of the type and quantity of available ingredient(s), meal preferences of the user, and the context of the meal. Recipe complements and/or supplements may be suggested in response to the user selecting a recipe from the list of recipe recommendations. Further, a meal planner may be used to track the shelf life of the ingredient(s), plan a meal schedule, and generate a shopping list | 2014-04-03 |
| 20140095480 | SEMANTIC ZOOM FOR RELATED CONTENT - Among other things, one or more techniques and/or systems are provided for displaying a related content view within a search interface. That is, a search interface, such as a search application, may provide search results that are relevant to a query submitted through the search interface. For example, a main search engine results view comprising one or more search results of the query may be presented within the search interface. Responsive to a semantic zoom operation (e.g., a touch gesture), the search interface may be transitioned from the main search engine results view to a related content view comprising related content that corresponds to the query and/or a (e.g., supplemental) search result for the query. In this way, the user may explore supplemental content, such as query suggestions, images, entity descriptions/profiles, videos, and/or other content, that may be related to a query submitted by the user. | 2014-04-03 |
| 20140095481 | SEARCHING DIGITAL RECEIPTS AT A MOBILE DEVICE - The present invention extends to methods, systems, and computer program products for searching digital receipts at a mobile device. A customer mobile device receives and stores one or more digital receipts. The one or more digital receipts correspond to transactions conducted with a merchant. A user can select search criteria for searching stored digital receipts. The search criteria can be applied to stored digital receipts. Any stored digital receipts that satisfy the search criteria can be returned for display. In some embodiments, search criteria are selected to search for digital receipts associated with a specified payment method, such as, for example, cash, check, credit card, debit card, gift card, etc. In other embodiments, search criteria are selected to search for digital receipts having a purchase date within a specified purchase date range. | 2014-04-03 |
| 20140095482 | SEARCHING DIGITAL RECEIPTS AT A MOBILE DEVICE - The present invention extends to methods, systems, and computer program products for searching digital receipts at a mobile device. A customer mobile device receives and stores one or more digital receipts. The one or more digital receipts correspond to transactions conducted with a merchant. A user can select search criteria for searching stored digital receipts. The search criteria can be applied to stored digital receipts. Any stored digital receipts that satisfy the search criteria can be returned for display. In some embodiments, search criteria are selected to search for digital receipts associated with a specified payment method, such as, for example, cash, check, credit card, debit card, gift card, etc. In other embodiments, search criteria are selected to search for digital receipts having a purchase date within a specified purchase date range. | 2014-04-03 |
| 20140095483 | PROCESSING EVENTS FOR CONTINUOUS QUERIES ON ARCHIVED RELATIONS - Techniques for counting event changes with archived relations are provided. In some examples, a query that identifies at least a data object may be identified. Additionally, the query may be evaluated against historical data associated with the data object. Additionally, in some instances, a listening service may be registered with the data object. Further, the query may be evaluated based at least in part on the data object and the historical data. | 2014-04-03 |
| 20140095484 | TAGGING SOCIAL MEDIA POSTINGS THAT REFERENCE A SUBJECT BASED ON THEIR CONTENT - A system may identify and tag social media postings that contain information of interest about a subject. The system may determine whether any of the social media postings that do not contain information indicative of the subject were posted in a context that is indicative of the subject; determine whether any of the social media postings contain information that is of interest about the subject; to add metadata tagging the information of interest about the subject to each of the postings that contains information that is of interest about the subject and that contains information that is indicative of the subject; and to add metadata tagging the information of interest about the subject to each of the postings that contains information that is of interest about the subject and that does not contain information that is indicative of the subject, but was posted in a context that is indicative of the subject. | 2014-04-03 |
| 20140095485 | PROCESSING PROGRAM DATA FOR MEDICAL PUMPS - An apparatus for maintaining a library of program data for medical pumps, the apparatus comprising: memory loaded with a database, the database including a plurality of program data records and a plurality of data key records, each program data record containing a set of program data items, at least some of the program data items included in the database for controlling operation of a medical pump, each data key record containing a data key and each data key identifying one of the data program records; a database management system programmed to link a data key to a set of program data; and a scanner in data communication with the database management system, the database management system being further programmed to receive a code scanned by the scanner, save the code in a data key record, and link the code to a set of program data, the code being a data key. | 2014-04-03 |
| 20140095486 | AGGREGATION SOURCE ROUTING - The present disclosure extends to methods, systems, and computer program products for optimizing aggregation services. The methods and systems for optimizing aggregation routing over a network of computers may comprise computing hardware and software, wherein the software comprises computer readable instructions that cause the computing hardware to receive a request from a user for aggregated account data through a PFM, retrieve a predetermined form for the account data corresponding to the requesting PFM, determine the optimal aggregation source corresponding to the request, reformat the request to be compatible with the optimal aggregation source, send the reformatted request to the optimal aggregation source over the network of computers, receive requested data from the optimal aggregation source over the network of computers, populate the predetermined form corresponding to the PFM, output the populated form to the requesting PFM, and present the aggregated account data by way of the PFM to the user. | 2014-04-03 |
| 20140095487 | SYSTEM AND METHOD USING SPECIALIZED COMPUTERS AND SOFTWARE FOR CREATING WINE AND MUSIC PAIRINGS - A system, method, specialized computers, and software for improving wine consumption experience is disclosed. In some configurations, descriptors for wine and or music may be determined. Wine and music profiles may be generated. Wine-music pairs may be created in certain configurations. In some configurations, a user may use certain configurations to select a particular wine, have his or her mobile device play a song matched to that wine. | 2014-04-03 |
| 20140095488 | DISTRIBUTED GLOBALLY ACCESSIBLE INFORMATION NETWORK IMPLEMENTED FOR RETRIEVING IN REAL TIME LIVE DATA FROM A COMMUNITY INFORMATION NETWORK - A distributed information network is constructed for gathering information from sites distributed across a globally accessible computer network, i.e., the Internet. The distributed information network preferably includes a root server that stores a list of multiple distributed sites each represented by metadata. A network browser delivers an information search request to the root server, which in response develops a profiled information search request. The information provider of each of the distributed sites stores metadata corresponding to information content that is retrievable in response to the profiled information search request for search results derivable from the information content to which the metadata correspond. A profiled information communication link between the root server and each of the multiple distribution sites enables formation of a path for delivery of the search results to a destination site, from a site or sites represented by the metadata of the profiled information search request. | 2014-04-03 |
| 20140095489 | DYNAMIC SUBMISSION AND PREFERENCE INDICATOR - Indicating preference for a content contribution is disclosed. A request for information associated with the content contribution is received from a first entity. The status of the content contribution is determined. A response is provided to the first entity. Determining the status of the content contribution includes determining whether a submission of the content contribution was previously received. | 2014-04-03 |
| 20140095490 | RANKING SUPERVISED HASHING - Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of which indicates the relative ranking for a pair of the data items in the ranked dataset. This ranking triplet can be merged with a hash table obtained using a standard hash function and the data items can be indexed based on the results. | 2014-04-03 |
| 20140095491 | Video and Digital Multimedia Aggregator - The present invention utilizes an aggregator for searching, packaging and delivering content. The aggregator processes requests, searches, provides search results and acquires content. The aggregator, operating in a communications network, includes a request and results processing server, a search engine server coupled to the request and results processing server and a content acquisition server coupled to the request and results processing server. A request and results processing server receives a request for content, the search engine server searches for the content and the content acquisition program acquires content for delivery to the user. The request and results processing server includes a search request processor that receives information related to a user's search request and provides the information to a search results form builder that creates an electronic search request. | 2014-04-03 |
| 20140095492 | REPUTATION BASED ON MULTIPLE PERSPECTIVES ON SOMEBODY'S PERSONALITY FROM QUALIFIED ASSOCIATIONS - A method, system, and apparatus for presenting information on a user in a social network is disclosed. In some embodiments, this includes analyzing a user profile for character traits, wherein the user profile is populated with information provided by third party users, determining a number of times the user has populated other users' profiles, determining a number of times the third party users have populated the user profile, calculating a user reputation score based on the analysis, the number of times the user has populated other users' profiles, and the number of times the third party users have populated the user profile, and storing the user reputation score in a storage device. | 2014-04-03 |
| 20140095493 | DOCUMENT RELEVANCY ANALYSIS WITHIN MACHINE LEARNING SYSTEMS - Systems and methods that quantify document relevance for a document relative to a training corpus and select a best match or best matches are provided herein. Methods may include generating an example-based explanation for relevancy of a document to a training corpus by executing a support vector machine classifier, the support vector machine classifier performing a centroid classification of a relevant document in a term frequency-inverse document frequency features space relative to training examples in a training corpus, and generating an example-based explanation by selecting a best match for the relevant document from the training examples based upon the centroid classification. | 2014-04-03 |
| 20140095494 | SYSTEM AND METHOD FOR DISTRIBUTED SEARCH-BY-CONTENT - A method for conducting search-by-content is provided. The method includes responsive to an input multimedia content item provided to a user device, checking if the input multimedia content item matches at least one concept of a plurality of concepts cached in the user device; retrieving characteristics set for a user of the user device; performing a search, using the at least one matching concept, for multimedia content items similar to the input multimedia content item; determining which of the search results are of interest to the user based on the characteristics set for the user; and saving results that are of interest to the user in the user device, wherein the saved results include multimedia content items. | 2014-04-03 |
| 20140095495 | Systems and Methods for Promoting Personalized Search Results Based on Personal Information - A method is performed at a server system having one or more processors and memory. The server receives a search query from a user and identifies a list of search results associated with the search query. Each search result has an initial position in the list. The server identifies a set of user-preferred search results that comprises search results in a search history of the user. Each of the user-preferred search results has been previously selected by the user for at least a predefined minimum number of times. The server identifies in the list of search results, one or more search results that are associated with at least one of the user-preferred search results and reorders the list of search results by moving each of the identified search results from its initial position by a non-zero offset. The server then provides the reordered list of search results to the user. | 2014-04-03 |
| 20140095496 | METHOD AND APPARATUS FOR PROVIDING USER-CORRECTED SEARCH RESULTS - An approach is provided for providing user-corrected search results. The explanation platform processes and/or facilitates a processing of one or more search results to calculate a ranking of the one or more search results. Next, the explanation platform determines one or more parameters related to calculating the ranking, one or more values of the one or more parameters, or a combination thereof. Then, the explanation platform causes, at least in part, a presentation of one or more representations of at least one of the one or more parameters as one or more explanations for the ranking. | 2014-04-03 |
| 20140095497 | MANAGING GEOGRAPHIC REGION INFORMATION - In an implementation, geographic region information is managed through storage, in a database, of respective sets of coordinates of elements and region identifiers of a plurality of geographic regions that are mapped onto the respective sets of coordinates of elements, in which the plurality of geographic regions are expanded to extend into additional elements prior to the storage of the respective sets of coordinates and the region identifiers. | 2014-04-03 |
| 20140095498 | Systems And Methods For Facilitating Access To Documents Via A Set Of Content Selection Tags - Systems and methods are provided to facilitate access to documents via a set of content selection tags. According to one embodiment, information is received from a content reader. For example, a content controller may receive information from a content reader via a Web site. A set of content selection tags are then established based on the received information, each content selection tag being associated with a hierarchical tag domain. It is then arranged for the content reader to receive an indication of a document tag in accordance with the set of content selection tags. For example, a content controller may retrieve one or more documents based on a set of content selection tags and document tags and transmit indications of the retrieved documents to a content reader via a Web site. | 2014-04-03 |
| 20140095499 | PROCESSING PROGRAM DATA FOR MEDICAL PUMPS - An apparatus for maintaining a library of program data for medical pumps, the apparatus comprising: memory loaded with a database, the database including a plurality of program data records and a plurality of data key records, each program data record containing a set of program data items, at least some of the program data items included in the database for controlling operation of a medical pump, each data key record containing a data key and each data key identifying one of the data program records; a database management system programmed to link a data key to a set of program data; and a scanner in data communication with the database management system, the database management system being further programmed to receive a code scanned by the scanner, save the code in a data key record, and link the code to a set of program data, the code being a data key. | 2014-04-03 |
| 20140095500 | EXPLANATORY ANIMATION GENERATION - Various embodiments included herein include at least one of systems, methods, and software for explanatory animation generation. Some embodiments include receiving data representative of at least two data items, each data item to be presented as a node. Relationships between these data items are discovered in an interrelated dataset and the relationship is illustrated as a set of sequential nodes on a canvas. A text-script descriptive of each of the nodes is then generated. Finally, such embodiments include generating a visualization with a synchronized voiceover based on the sequence nodes and the text-script, the visualization including each node with a synchronized voiceover of each node. | 2014-04-03 |
| 20140095501 | System and Method of Integrating Enterprise Applications - The present disclosure includes systems and techniques relating to enterprise application integration. In general, one aspect of the subject matter described in this specification can be embodied in a computer system including a service oriented architecture (SOA), where the system includes a composite application configured to present sales targeted information by combining services from multiple application resources on a network, wherein the multiple application resources include: a sales force automation (SFA) tool configured to automate sales and sales force management functions; a real-time predictive analytics tool configured to evaluate customer purchasing data and recommend products or services based on the customer purchasing data; a knowledge management tool configured to search and retrieve data across multiple integrated applications; and a calendar tool configured to manage appointment scheduling. The multiple application resources can further include a collaboration tool; and a business intelligence tool, including at least one live news feed. | 2014-04-03 |
| 20140095502 | CLUSTERING A TABLE IN A RELATIONAL DATABASE MANAGEMENT SYSTEM - Techniques are provided that address the problems associated with prior approaches for clustering a fact table in a relational database management system. According to one aspect of the invention, a database server clusters a fact table in a database based on one or more dimension tables. More specifically, rows are stored in the fact table in a sorted order and the order in which the rows are sorted is based on values in one or more columns of one or more of the dimension tables. A user specifies the columns of the dimension tables on which the sorted order is based in “clustering criteria”. The database server uses the clustering criteria to automatically store the rows in the fact table in the sorted order in response to certain user-initiated database operations on the fact-table. | 2014-04-03 |
| 20140095503 | COMPILE-TIME GROUPING OF TUPLES IN A STREAMING APPLICATION - A system and a method for initializing a streaming application are disclosed. The method may include initializing a streaming application for execution on one or more compute nodes which are adapted to execute one or more stream operators. The method may, during a compiling of code, identify whether a processing condition exists at a first stream operator of a plurality of stream operators. The method may add a grouping condition to a second stream operator of the plurality of stream operators if the processing condition exists. The method may provide for the second stream operator to group tuples for sending to the first stream operator. | 2014-04-03 |
| 20140095504 | SYSTEMS AND METHODS FOR CATALOGING USER-GENERATED CONTENT - Systems and methods are described herein for cataloging user-generated content. In one embodiment, user-generated content is received, and metadata associated with the user-generated content may be captured. The metadata may be automatically analyzed to determine one or more common characteristics of the user generated content. For example, it may be determined that the user-generated content was recorded during a trip along a particular route, or during a period where the user was exhibiting stressful physiological signs. Groupings of user-generated content may be defined based on the common characteristics. Post-processing and file storage operations may be performed on the user-generated content associated with a grouping. Groupings may be selected for playback and the user-generated content may be streamed to a target device. | 2014-04-03 |
| 20140095505 | PERFORMANCE AND SCALABILITY IN AN INTELLIGENT DATA OPERATING LAYER SYSTEM - Systems and methods that allow for an intelligence platform for distributed processing of big data sets including both structured and unstructured data types across two or more intelligent data operation engine servers. The intelligent data operation engine servers can form a conceptual understanding of content in each electronic file and then cooperates with a distributed index handler to index the conceptual understanding of the electronic file. A query pipeline and the distributed index handler in the intelligence platform cooperate with the two or more intelligent data operation engine servers to improve scalability and performance on the big data sets containing both structured and un-structured electronic files represented in the common index. | 2014-04-03 |
| 20140095506 | COMPILE-TIME GROUPING OF TUPLES IN A STREAMING APPLICATION - A system and a method for initializing a streaming application are disclosed. The method may include initializing a streaming application for execution on one or more compute nodes which are adapted to execute one or more stream operators. The method may, during a compiling of code, identify whether a processing condition exists at a first stream operator of a plurality of stream operators. The method may add a grouping condition to a second stream operator of the plurality of stream operators if the processing condition exists. The method may provide for the second stream operator to group tuples for sending to the first stream operator. | 2014-04-03 |
| 20140095507 | LIBRARY APPARATUS - A library apparatus according to an aspect of the present invention includes a plurality of magazines each including medium slots in which corresponding removable storage media are stored, and a magazine ID for identifying itself; at least one magazine slot each of which, at a time when one of the magazines has been loaded into itself, allocates physical slot numbers to the magazine; an ID reading unit; a logical library configuration information table including magazine presence or absence information which indicates whether or not any of the magazines is loaded in each of the at least one magazine slot; and a logical library management unit which updates the magazine presence or absence information on the basis of information indicating which of the at least one magazine slot the relevant magazine has been loaded into, and the magazine ID of the relevant magazine. | 2014-04-03 |
| 20140095508 | EFFICIENT SELECTION OF QUERIES MATCHING A RECORD USING A CACHE - A method is provided for constructing a cache for storing results of previously evaluated queries in a binary tree based on a cache key. The cache is searched, by a processing device, for a node representing a set of previously evaluated queries that match a given record using an instance of the cache key. In response to finding a representative node that matches the instance of the cache key, the method performs processing associated with the set of previously evaluated queries. In response to finding no representative nodes, the method creates a new node using the instance of the cache key. The method of the invention then updates the cache by classifying the compatibility of newly registered queries with the cache key and evaluating whether compatible newly registered queries match the record. | 2014-04-03 |
| 20140095509 | METHOD OF TAGGING CONTENT LACKING GEOTAGS WITH A LOCATION - A method including: at a system, determining a set of user accounts associated with a first user for each of a set of social networking services, an event timeframe for an event, and an event location for the event; receiving, at the system, a set of digital content generated by the set of user accounts during the event timeframe; in response to detection of a first digital content lacking a geographic location information within the digital content set, associating the event location with the first digital content; and in response to receipt of a query comprising an identifier for the event from a device, sending the first digital content to the device. | 2014-04-03 |
| 20140095510 | Information Presentation Method, System, Client and/or Server - Systems and methods are provided for presenting information. For example, a trigger command is acquired; one or more first points of interest are selected based on at least information associated with the trigger command; a first zone associated with the first points of interest is acquired from an electronic map, the electronic map being divided into a plurality of second zones including the first zone; a predetermined number of third zones are acquired from the plurality of second zones, the first zone being included at a center area of the third zones; one or more first messages published in the third zones and one or more first geographic positions corresponding to the one or more first messages are acquired; and the first messages published in the third zones and the corresponding first geographic positions are presented according to certain embodiments. | 2014-04-03 |
| 20140095511 | MULTIPLE INDEX BASED INFORMATION RETRIEVAL SYSTEM - An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are identified that predict the presence of other phrases in documents. Documents are the indexed according to their included phrases. The document index is partitioned into multiple indexes, including a primary index and a secondary index. The primary index stores phrase posting lists with relevance rank ordered documents. The secondary index stores excess documents from the posting lists in document order. | 2014-04-03 |
| 20140095512 | RANKING SUPERVISED HASHING - Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of which indicates the relative ranking for a pair of the data items in the ranked dataset. This ranking triplet can be merged with a hash table obtained using a standard hash function and the data items can be indexed based on the results. | 2014-04-03 |
| 20140095513 | COLLECTION AND REPORTING OF CUSTOMER SURVEY DATA - The embodiments may provide a system for managing survey data including a survey metadata handler configured to receive survey metadata for a survey type, and a survey result handler configured to receive one or more completed or partially completed surveys providing one or more answers to questions corresponding to the survey type, a calculating unit configured to calculate one or more weighted answers based on the question weights and the one or more answers, and a satisfaction score for each completed or partially completed survey based on the one or more weighted answers, a category determining unit configured to determine a satisfaction category for the survey type based on the satisfaction scores and satisfaction category information mapping satisfaction categories to satisfaction scores for the survey type, and a database configured to store the survey metadata, the survey results, and the satisfaction category information, as a layered data model. | 2014-04-03 |
| 20140095514 | Ordinal Positioning Of Content Items Based On Viewport - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for adjusting ordinal positions for content item slots in response to determining that a content item slot with a highest slot ordinal position relative to the other content item slots in a resource is not within a viewport area. Adjusting the adjusting ordinal positions of either the content item slots or content items to be served in the content item slots ensures that a content item slot in the viewport displays a content item with a highest respective ordinal position in a ranking relative to other content items is rendered in the content item slot within the viewport area. | 2014-04-03 |
| 20140095515 | REAL TIME SINGLE-SWEEP DETECTION OF KEY WORDS AND CONTENT ANALYSIS - A system and method are provided for real-time analysis of text. During a single sweep through the text, a detection tree is used to identify a sequence of characters in the text from a large dictionary of keywords. When a keyword is detected a rule tally database is updated. An intermediate score may be available during the sweep and a final score of the text may be available substantially immediately upon finishing the single sweep. A second text may be analyzed immediately using the same score buffer and rule tally database without updating the rule tally database. | 2014-04-03 |
| 20140095516 | Profile Construction Using Location-Based Aggregate Profile Information - Systems and methods are disclosed for creating a user profile for a subject user based on historical aggregate profile data for locations at which the subject user was previously located. In one embodiment, one or more location and time period pairs are determined for the subject user, each defining a previous location of the subject user and a time period during which the subject user was at the location. For a plurality of location and time period pairs, a plurality of historical aggregate profiles for a corresponding plurality of sub-bands within the time period defined by each location and time period pair in the plurality of location and time period pairs is obtained. A user profile for the subject user is created based on the plurality of historical aggregate profiles for the corresponding plurality of sub-bands based on relevancy ratings for the plurality of sub-bands. | 2014-04-03 |
| 20140095517 | PREDICATE RESULT CACHE - In token compression, a column value is represented by a encoded token. During early predicate evaluation, the result that a decoded token in a column does not satisfy a predicate condition in a predicate conjunction is recorded in a cache as a “FALSE”. Such a result not only means that when the column contains that token that the predicate condition is not satisfied, but also that a predicate conjunction containing the predicate condition is not satisfied. When performing early predicate evaluation on a subsequent row on a token in a column, the conjunction result cache is referred to. If the cache records a FALSE for that token in that column, then it is known the predicate conjunction cannot be satisfied by the decoded token. | 2014-04-03 |
| 20140095518 | CALCULATED MEASURES AS ATTRIBUTE FILTERS - Systems and methods for using calculated measures as attribute filters are provided. In example embodiments, a query for a result set is processed. The query includes a filter attribute that is absent from a base table from which the result set is to be obtained. A set of measures associated with the filter attribute that is absent from the base table is calculated. The base table is extended to include the calculated set of measures associated with the filter attribute that is absent from the base table to create an extended table. The extended table is filtered based on the filter attribute to create a filtered extended table. The result set is derived using the filtered extended table. | 2014-04-03 |
| 20140095519 | Evaluating XML Full Text Search - Processes, machines, and stored instructions are provided for storing posting lists for tokens in XML documents and using the posting lists to process queries. For each occurrence of a token in the XML documents, a document processor adds an entry to a list for the token. The entry for the token maps the token to documents or nodes within the documents where the tokens can be found. The document processor may also detect tags in the XML documents and, for each occurrence of a tag, add an entry to a list for the tag. The entry for the tag specifies a range of locations covered by the tag. A query processor may then receive a full text query for evaluation against XML documents, and the query processor may determine a result set for the query using the lists for the tokens and/or the lists for the tags. | 2014-04-03 |
| 20140095520 | PRUNING DISK BLOCKS OF A CLUSTERED TABLE IN A RELATIONAL DATABASE MANAGEMENT SYSTEM - Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped. | 2014-04-03 |
| 20140095521 | DATA AUGMENTATION - A data augmentation machine may form all or part of a data augmentation system that is configured to augment data. The data augmentation machine may be configured (e.g., by one or more software modules) to access data (e.g., by crawling one or more public or private networks), extract metadata based on the data (e.g., from the data and its source), create a link to additional data (e.g., based on the extracted metadata), and augment the extracted metadata (e.g., by storing augmented metadata with the extracted metadata). Such augmented metadata may be presented (e.g., within a user interface), published publicly (e.g., on a webpage), published privately (e.g., in a report available only to premium subscribers of a data augmentation service), or any suitable combination thereof. | 2014-04-03 |
| 20140095522 | REFERENCE DATA SEGMENTATION FROM SINGLE TO MULTIPLE TABLES - Embodiments of the present invention can be used to improve cross reference look-up performance by performing multi-table data segmentation. In accordance with an embodiment, a method of multi-table data segmentation can comprise augmenting each of a plurality of definition files associated with a database table with multi-table data. The method can further comprise creating a plurality of multi-tables. Each multi-table is associated with a different one of the plurality of definition files. The method can further comprise transposing data stored in the database table based on the plurality of definition files, and migrating the transposed data from the database table to the plurality of multi-tables. | 2014-04-03 |
| 20140095523 | APPARATUS AND METHOD FOR CONVERTING VO - An apparatus and a method for converting a value object (VO) are disclosed. An object generating unit reads out data recorded in an input file in specific units, and generates the VO corresponding to the specific units. An object processing unit includes a byte array storing a column value included in the specific units and an object array storing a field value of the VO, and processes provision and change of the column value. A metadata providing unit provides metadata including a size and a data type of each column included in the specific units for the object processing unit. According to the present invention, when generating the VO from data stored with different data formats, and when converting the VO into the different type of data formats, conversion costs are minimized and data processing performance is improved. | 2014-04-03 |
| 20140095524 | MANAGING ITEM QUERIES - A network-based service may be provided for facilitating queries for a number of items, such as travel services. A user may submit a query including criteria for determining one or more relevant items. Based on the submitted query, the network-based service may present the user with information regarding the actions of other similar users of the network-based service, such as searches performed by the other users. Based on this information, the user may elect to supplement the current query to conform to the actions for other users. In some embodiments, actions by other users may be based at least in part on a category of the querying user. By presenting actions of similar users, a current user may be enabled to select the most relevant query terms for identifying a desired item. | 2014-04-03 |
| 20140095525 | TACTICAL QUERY TO CONTINUOUS QUERY CONVERSION - Techniques for managing tactical query to continuous query conversion are provided. In some examples, a tactical query configured to enable the pulling of business event data from a database to a query engine may be determined. For example, a query engine may be configured with the tactical query. The configuration may be based at least in part on an indication of the business event data to be displayed. Further, in some examples, a conversion of the tactical query to a continuous query may be enabled. The conversion or enablement of the conversion may be based at least in part on a request. | 2014-04-03 |
| 20140095526 | Random Number Generator In A MPP Database - A random number generation process generated uncorrelated random numbers from identical random number sequences on parallel processing database segments of an MPP database without communications between the segments by establishing a different starting position in the sequence on each segment using an identifier that is unique to each segment, query slice information and the number of segments. A master node dispatches a seed value to initialize the random number sequence generation on all segments, and dispatches the query slice information and information as to the number of segments during a normal query plan dispatch process. | 2014-04-03 |
| 20140095527 | EXPANDING HIGH LEVEL QUERIES - A received query is modified by identifying one or more words or phrases in the query that have known associations with stored data upon which the query can be executed, determining whether each of the one or more words or phrases is associated with an attribute name corresponding to stored data, determining whether each of the one or more words or phrases is associated with any constraints regarding an attribute name, determining whether each of the one or more words or phrases is associated with a rule regarding structure or syntax of the query, substituting any determined attribute names into the query for each of the respective associated one or more words or phrases, adding any determined constraints to the query limiting a determined attribute name, and applying any determined rules associated with the one or more words or phrases. | 2014-04-03 |
| 20140095528 | CONTEXTUAL QUERY REVISION - Apparatus, systems and methods for contextual query revision are disclosed. A current search query is received during a search session. The current search query includes one or more current search tokens. Potentially inaccurate search tokens are identified from the one or more current search tokens. A possible replacement token is identified based upon the potentially inaccurate search token. A group of related tokens is identified from query logs, and a modified search query is generated if the replacement token is not included in the related tokens. | 2014-04-03 |
| 20140095529 | CONFIGURABLE DATA WINDOWS FOR ARCHIVED RELATIONS - Techniques for managing configurable data windows for streams and/or archived relations are provided. In some examples, a query that identifies at least a data stream or an archived relation may be identified. Additionally, a configurable window size may be identified. In some instances, the query may be initialized with at least a portion of the historical data based at least in part on the window size. Further, the query may be evaluated based at least in part on the data stream and the portion of the historical data. | 2014-04-03 |
| 20140095530 | CONTAINER DATABASE - A container database may contain multiple database dictionaries, each database dictionary defining a pluggable database. When database sessions are established on a container DBMS, each database session is given access to a pluggable database by establishing the respective database dictionary of the pluggable database as the database dictionary for that database session. Database commands issued through database session can only access the database objects defined in the database dictionary established for the database session. | 2014-04-03 |
| 20140095531 | DYNAMIC OUTPUT SELECTION USING HIGHLY OPTIMIZED DATA STRUCTURES - A node container is constructed with multiple binary tree views. A processing device creates a primary view binary tree within the node container based on a primary key. A set of records that match fields of the primary key is chained to the primary view. The processing device also creates one or more alternate views within the node container to allow access to the same set of records via one or more alternate keys, which are subsets of the fields of the primary key. The chain of records is extracted from the node container when matched to a subsequent query search. | 2014-04-03 |
| 20140095532 | Methods and Systems for Identifying Local Search Queries - Methods and systems are provided for determining whether a search query with an observed number of occurrences in a set of search queries is a local search query. In accordance with one implementation, a method is provided that comprises determining an expected number of occurrences of a search query and comparing the expected number of occurrences to a threshold. Further, the method includes determining whether the search query is a local search query based, at least in part, on the comparison. | 2014-04-03 |
| 20140095533 | FAST PATH EVALUATION OF BOOLEAN PREDICATES - Techniques for managing fast path evaluation of Boolean predicates are provided. In some examples, the fast path evaluation may be based at least in part on received queries and/or query statements associated with a database and/or streaming data. In some examples, a first instruction for enabling execution of a subset of logical operators of the query may be determined. The determination may be based at least in part on the logical operators of the query. Additionally, based at least in part on the first instruction, logical instructions for implementing the query may be generated. Further, the logical instructions may be compiled into machine-readable instructions for implementing only the subset of the logical operators of the query. | 2014-04-03 |
| 20140095534 | SEMI-JOIN ACCELERATION - Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query. | 2014-04-03 |
| 20140095535 | MANAGING CONTINUOUS QUERIES WITH ARCHIVED RELATIONS - Techniques for managing continuous queries with archived relations are provided. In some examples, a query that includes at least a data stream may be identified. Additionally, the query may be initialized with at least a portion of historical data. Further, in some instances, the query may be evaluated based at least in part on the data stream and the portion of the historical data. | 2014-04-03 |
| 20140095536 | SYSTEM AND METHOD FOR ANALYSIS OF MUITIMEDIA CONTENT ITEMS - A method and server for analyzing a multimedia content item are provided. The method comprises receiving a multimedia content item; extracting from the multimedia content item a plurality of multimedia elements; generating at least one signature for each of the plurality of multimedia elements; for each of the plurality of multimedia elements, querying a deep-content-classification (DCC) system to identify at least one concept that matches one of the plurality of multimedia elements, wherein querying is performed using the at least one signature generated for the multimedia elements and wherein an unidentified multimedia content element does not have a matching concept; generating a context for the multimedia content item using matching concepts; and characterizing each unidentified multimedia element using the generating context and signatures of the matching concepts. | 2014-04-03 |
| 20140095537 | REAL-TIME BUSINESS EVENT ANALYSIS AND MONITORING - Techniques for managing real-time business event analysis and monitoring are provided. In some examples, a logical request may be received at a business intelligence server configured with a continuous query service. Additionally, the continuous query service may be configured to translate the logical request into a physical request. Further, business intelligence information may be provided based at least in part on querying against an event data stream with a continuous query configured based at least in part on the physical request translated by the continuous query service. | 2014-04-03 |
| 20140095538 | Digital File Distribution in a Social Network System - Systems and methods for obtaining a digital file similar to one used by a device associated with a member of a social network are provided. Digital file information about the digital file is stored on a web-based social network database. The digital file may be located on the same server as the web-based social network database or a third party server such as a mobile phone carrier. A user of the web-based social network database requesting the digital file may require a different format of the digital file than that used by the device of the member. If a different format is requested by the user, a server finds or converts the digital file to be compatible for use by a device specified by the user. | 2014-04-03 |
| 20140095539 | SYSTEM AND METHOD FOR ASYNCHRONOUS CLIENT SERVER SESSION COMMUNICATION - The invention provides a session-based bi-directional multi-tier client-server asynchronous information database search and retrieval system for sending a character-by-character string of data to an intelligent server that can be configured to immediately analyze the lengthening string character-by-character and return to the client increasingly appropriate database information as the client sends the string. | 2014-04-03 |
| 20140095540 | MECHANISM TO CHAIN CONTINUOUS QUERIES - Techniques for implementing mechanisms for chaining continuous queries are provided. In some examples, results of a first continuous query may be stored in a data object. For example, the first continuous query may be configured to process business event data and store the results in the data object. Additionally, a second continuous query may then be processed based at least in part on the results stored in the data object. | 2014-04-03 |
| 20140095541 | MANAGING RISK WITH CONTINUOUS QUERIES - Techniques for managing risks with continuous queries are provided. In some examples, a selection of a data object enabled to provide a real-time stream of business event data may be received. The selection may be received by a user associated with the business event data. Additionally, a continuous query language query may be generated. The query may be configured to monitor the real-time stream of business event data for a first metric. In some examples, the a risk indicator associated with a second metric that affects the first metric may be identified. Output events of a pre-existing continuous query language query may be listened to. Further, a real-time visualization of the first metric and/or the second metric may be provided. | 2014-04-03 |
| 20140095542 | INTERACTIVE DATA MINING - A data mining system receives a data set that includes a plurality of columns of data. The system determines correlations between columns of data of the data set and displays an interactive listing of a plurality of pairs of columns based on the correlations. The listing includes preview information based on the correlations for each pair. The system receives a selection of a value from the interactive listing from a user and refines the data set in response to the selection. | 2014-04-03 |
| 20140095543 | PARAMETERIZED CONTINUOUS QUERY TEMPLATES - Techniques for managing parameterized continuous query templates are provided. In some examples, a continuous query may be generated based at least in part on one or more selections of one or more business logic templates and business event parameters associated with a user. The continuous query may also be configured to retrieve business event data of the user. In some examples, a service provider may receive selection of one or more business logic templates. The service provider may also receive the business event parameters associated with the user. The business event parameters may be received via the selected template. The continuous query may then be generated using the information received via the template. | 2014-04-03 |
| 20140095544 | COORDINATED ACCESS TO A CLUSTERED FILE SYSTEM'S SHARED STORAGE USING SHARED-LOCK ARCHITECTURE - Embodiments of the invention relate to coordinated access to a clustered file system's shared storage subsystem using a shared-lock architecture. A particular file server is configured to coordinate the file system's file access layout particular server, in response to a client's file access layout request for byte-ranges of a file stored in the storage subsystem being received by a file server in cluster and sent to said particular server, generates a file access layout of a set of file servers for a parallel file access protocol to use and byte ranges of the file that particular individual file servers to use, to service an I/O request for the file. The file server (that received the request), sends the generated file access layout to said client, and requests coordinated access to said file from the particular server in response to receiving an I/O request to byte-ranges of said file. | 2014-04-03 |
| 20140095545 | METHODS AND SYSTEMS FOR CONTROLLING ACCESS TO CUSTOM OBJECTS IN A DATABASE - In embodiments, methods and systems for controlling access to custom objects are provided. These techniques for controlling access to custom objects can enable embodiments to utilize a key for the protection of the security of data that is to remain private while not compromising efficiency of a query. The key for a requested custom object is identified and then used so that only an appropriate portion of a custom entity share table is searched to locate access information. It is then determined whether the user can access at least a portion of the custom object, and the appropriate and allowed data is sent to the user. | 2014-04-03 |
| 20140095546 | COMMON USERS, COMMON ROLES, AND COMMONLY GRANTED PRIVILEGES AND ROLES IN CONTAINER DATABASES - Techniques for common users and roles, and commonly-granted privileges and roles are described. In one approach, the DBMS of a container database allows for the creation of common roles and common users that are shared across the container database. Thus, when a common role or a common user is established, the common role or common user is propagated to each database of the container database. In another approach, the DBMS of a container database allows privileges and roles to be granted commonly or locally. When a privilege or role is granted commonly, the privilege applies in each of the databases of a container database. When a privilege or role is granted locally, the privilege applies only in the database to which the grantor of the privilege or role established a connection. | 2014-04-03 |
| 20140095547 | TECHNIQUES FOR ACTIVITY TRACKING, DATA CLASSIFICATION, AND IN DATABASE ARCHIVING - Techniques for activity tracking, data classification, and in-database archiving are described. Activity tracking refers to techniques that collect statistics related to user access patterns, such as the frequency or recency with which users access particular database elements. The statistics gathered through activity tracking can be supplied to data classification techniques to automatically classify the database elements or to assist users with manually classifying the database elements. Then, once the database elements have been classified, in-database archiving techniques can be employed to move database elements to different storage tiers based on the classifications. However, although the techniques related to activity tracking, data classification, and in-database archiving may be used together as described above; each technique may also be practiced separately. | 2014-04-03 |
