| 27th week of 2013 patent applcation highlights part 63 |
| Patent application number | Title | Published |
|---|
| 20130173494 | KNOWLEDGE BOURSE - Exemplary embodiments are disclosed for trading in knowledge stocks and knowledge futures. Systems and methods establish a bourse specialized in trading in various forms of knowledge encompassing inventions and intellectual properties and any type of explicit knowledge that have tangible value in the marketplace. Such value varies according to the supply and demand as well as the financial return that can be accrued by investors in the knowledge market. The creation of a knowledge bourse will provide a market for trading in knowledge stocks and commodities of different types. | 2013-07-04 |
| 20130173495 | SYSTEM AND METHOD FOR INTEGRATING, EVALUATING, AND MANAGING FINANCIAL DATA - Asset evaluation systems and methods are presented in which a financial firm's reported holdings may be received and evaluated based on external data sources. The asset evaluation systems and methods may then make a determination as to the risk involved in the financial firm's holdings portfolio and report risky or fraudulent activity. | 2013-07-04 |
| 20130173496 | MULTICAP VALUE INVESTMENT METHODOLOGY - A system and method manages an investment portfolio. The system includes at least one processor programmed to receive performance data for a plurality of investable entities forming a market. Risk adjusted discount cash flow (RA-DCF) values are then calculated for the investable entities using the received performance data. In response to at least one trigger, a predetermined number of the investable entities with RA-DCF values less than corresponding current market values are selected and the investment portfolio is rebalanced to include the selected investable entities. | 2013-07-04 |
| 20130173497 | METHODS AND SYSTEMS FOR CREATING NEW DOMAINS - Systems and methods for creating a new domain, such as a top-level domain or a second-level domain, make use of a Domain Manager that enables a user to enter data that is necessary or optional to implement the creation of a new domain. Systems such as, for example, a Registry and one or more Registrars, may use the data defined by the Domain Manager to create a new domain. | 2013-07-04 |
| 20130173498 | CALCULATION OF ACCURATE COSTS OF TRANSFERS BETWEEN COST GROUPS - Various arrangements for calculating costs of transferable items in accordance with an iterative periodic average costing model are presented. Indications of a plurality of transfers of transferable items among cost groups of a plurality of cost groups may be received. A plurality of matrices may be created. Elements of each matrix may correspond to iterative periodic average costing equations evaluated for the infinite iteration using the plurality of transfers of transferable items among cost groups and the plurality of cost groups. The cost of each transferable item within each cost group of the plurality of cost groups may be calculated using the plurality of matrices having the elements of each matrix corresponding to the iterative periodic average costing equations evaluated for the infinite iteration. | 2013-07-04 |
| 20130173499 | ROBUST CLOUD COMPUTING E-DISCOVERY PLATFORM - System, method, and computer program product are provided for a robust cloud computing e-discovery platform (RCCEP). The RCCEP program allows users to select different applications from different vendors for each phase of e-discovery. A cloud may be populated by vendors supplying e-discovery resources. Once the cloud is populated, users may, in some embodiments, opt-in to access the cloud. In other embodiments, the cloud may be provided to the user privately. The user may access the vendor e-discovery resources that are on the cloud based on the phase of e-discovery the user. In this way, the user may select one vendor's e-discovery resource to use for one phase of e-discovery and subsequently select a different vendor's e-discovery resource for a second phase of e-discovery. This invention provides an enterprise-wide e-discovery technology solution that encompasses the best of all vendors' systems in all phases of the e-discovery process. | 2013-07-04 |
| 20130173500 | ELECTRONIC POWER METER AND METHOD FOR STORING DATA THEREOF - The present disclosure relates to an electronic power meter and a method for storing data thereof. The electronic power meter includes a communication unit that receives a critical peak pricing rate data, a memory that stores first metering data corresponding to the critical peak pricing rate data received via the communication unit, and second metering data corresponding to a predetermined varying pricing rate data, the memory storing the first metering data and the second metering data into different storage areas respectively, and a controller that calculates metering data by applying a corresponding rate for each time slot according to the varying pricing rate or the critical peak pricing rate. | 2013-07-04 |
| 20130173501 | Decorative Clip and Multiple Interchangeable Ornamental Pendant Accessory System - A clip with two elongated members each having a forward end defining a gripping portion; a rear end defining a pinching portion and a centrally disposed pivot portion about which each memnber pivots. A resilient member in the form of a spring acts to bias the gripping portions into abutment with each other and to hold the elongated members together. The invention is to provide a simple arrangement for attaching and wearing a jewelry accessory item to one's clothing and gear and to allow the wearer the ability to easily add, remove, trade, exchange, collect, or replace ornamental pendants and the like to the decorative clip. | 2013-07-04 |
| 20130173502 | Preparation of An Edible Product From Dough - The present invention is directed to mold control and extended shelf life methods and compositions for preparing edible dough-based products, such as, for example, breads, by treating the surface of the dough used to prepare the edible product with at least one preservative and at least one pH adjusting agent prior to or during baking. The present invention is also directed to methods and compositions for preparing edible dough-based products, such as, for example, breads, by treating the surface of the dough used to prepare the edible product with a at least one pH adjusting agent prior to or during baking. | 2013-07-04 |
| 20130173503 | COMPOUND SELECTION IN DRUG DISCOVERY - Methods and systems for determining the selection criteria that in its embodiments can distinguish compounds that successfully meet an objective from those that do not, determine the importance of selection criterion in selecting test compounds that have a high probability of achieving an objective and automatically apply the selection criteria to select test compounds with a high chance of meeting an objective. | 2013-07-04 |
| 20130173504 | SYSTEMS AND METHODS FOR ACTION RECOGNITION - Systems provided herein include a learning environment and an agent. The learning environment includes an avatar and an object. A state signal corresponding to a state of the learning environment includes a location and orientation of the avatar and the object. The agent is adapted to receive the state signal, to issue an action capable of generating at least one change in the state of the learning environment, to produce a set of observations relevant to a task, to hypothesize a set of action models configured to explain the observations, and to vet the set of action models to identify a learned model for the task. | 2013-07-04 |
| 20130173505 | System and Method For Artificial Lift System Analysis - A system, method, and computer program product are disclosed for analysis of artificial lift systems. An Artificial Lift Analysis Solution (ALAS) is also provided to view and analyze artificial lift well data trends, prediction and detection event alerts, and to diagnose system conditions to facilitate production optimization. Production well information is provided for a plurality of the production wells each being associated with an artificial lift system. Artificial lift system failure alerts for the plurality of production wells are received and processed on a computer. A relevance measure for each of the artificial lift system failure alerts is determined responsive to the production well information. A summary of the artificial lift system failure alerts is displayed in an ordering based on the relevance measure. | 2013-07-04 |
| 20130173506 | HYBRID LOCATION USING PATTERN RECOGNITION OF LOCATION READINGS AND SIGNAL STRENGTHS OF WIRELESS ACCESS POINTS - A query device scans radio frequencies for visible transmitting devices. The querying device receives at least a signal strength and identifier information associated with each of the transmitting devices. The list of visible devices is used to query a database containing location information for a plurality of visible devices. The list may be sent to a locationing system that may perform a location analysis on the resulting data to return a location to the query device. The weighted average of the locations returned in the database query may be computed to determine the location of the querying device, with the weight for each of the locations being the current signal strength detected by the querying device. Neural network analysis may also be used to determine the location of the querying device. Learning and seeding operations many also be used to populate the database with location information for transmitting devices. | 2013-07-04 |
| 20130173507 | ADAPTIVE CUSTOMIZED PRESENTATION OF BUSINESS INTELLIGENCE INFORMATION - In one example, a method includes receiving information on a user role of a user account associated with a business intelligence system. The method further includes gathering information on interactions of the user account with the business intelligence system. The method further includes generating an initial business intelligence output based on data from one or more data sources. The method further includes generating a customized business intelligence output for the user account based on the initial business intelligence output, the user role, and the interactions of the user account with the business intelligence system. The method further includes providing the customized business intelligence output to the user account. | 2013-07-04 |
| 20130173508 | DEFECT CLASSIFICATION APPARATUS - The present invention has its objective to provide a defect classification apparatus which suppresses over-fitting and accurately classify the defect type of a defect. A defect classification apparatus is provided in which a data point indicating feature information of a defect to be classified having an unknown defect type is mapped to a point in a mapping space having a dimensional number higher than the number of features constituting the feature information, and the defect type of the defect to be classified is classified based on in which of two regions of defect type, which are formed by separating the mapping space by a decision boundary, the mapped point is located, wherein a discriminant function indicating the decision boundary is determined by adopting a weight which minimizes the sum of the classification error, which corresponds to the accuracy in classifying a training defect dataset, and a regularization term, which has a positive correlation with the dimensional number of the decision boundary, as the weight for each feature constituting the discriminant function. | 2013-07-04 |
| 20130173509 | METHOD AND ARRANGEMENT FOR PROCESSING DATA - A method and arrangement for processing data when training a data model involving multiple iterations of data records in a dataset ( | 2013-07-04 |
| 20130173510 | METHODS AND SYSTEMS FOR USE IN REDUCING SOLUTION CONVERGENCE TIME USING GENETIC ALGORITHMS - A computer system for finding a solution using a genetic algorithm is provided. The computer system includes a display, a user input device, at least one processor, and computer readable media. The at least one processor is programmed to execute a genetic algorithm. The genetic algorithm includes an initialization stage, an evolution stage, and an output stage. The evolution stage includes a domain restraint process. During the domain restraint process, children created during the evolution stage are compared with an environmental influence which represents domain knowledge. Children are influenced using the environmental influence in order to reduce the search domain by avoiding solutions known to be sub-optimal. | 2013-07-04 |
| 20130173511 | USING GLOBAL AND LOCAL CATASTROPHES ACROSS SUB-POPULATIONS IN PARALLEL EVOLUTIONARY COMPUTING - A parallel genetic algorithm computing process tracks forward progress of a first sub-population across generations thereof. The first sub-population is one of a plurality of sub-populations that form a population of candidate solutions to an optimization problem. At a current generation of the first sub-population, it is determined that forward progress of the first sub-population fails a set of one or more forward progress criteria. In response to determining that the forward progress of the first sub-population fails the set of one or more forward progress criteria at the current generation, a local catastrophe is invoked on the current generation of the first sub-population. The first sub-population is re-populated after the local catastrophe is invoked. The first sub-population is re-established after re-populating while constraining migration to the first sub-population. | 2013-07-04 |
| 20130173512 | USING GLOBAL AND LOCAL CATASTROPHES ACROSS SUB-POPULATIONS IN PARALLEL EVOLUTIONARY COMPUTING - A parallel genetic algorithm computing process tracks forward progress of a first sub-population across generations thereof. The first sub-population is one of a plurality of sub-populations that form a population of candidate solutions to an optimization problem. At a current generation of the first sub-population, it is determined that forward progress of the first sub-population fails a set of one or more forward progress criteria. In response to determining that the forward progress of the first sub-population fails the set of one or more forward progress criteria at the current generation, a local catastrophe is invoked on the current generation of the first sub-population. The first sub-population is re-populated after the local catastrophe is invoked. The first sub-population is re-established after re-populating while constraining migration to the first sub-population. | 2013-07-04 |
| 20130173513 | CONTEXT-BASED DEVICE ACTION PREDICTION - The described implementations relate to automatically performing device actions. One implementation can obtain a contextual value of a contextor. The implementation can decide, using a decision engine, whether to perform an action on a computing device based on the contextual value. In an instance when the decision engine decides that the action is to be performed, the implementation can perform the action on the computing device. The implementation can also update the decision engine using feedback related to the action. As a specific example, the action can be prelaunching an application before a user has requested to execute the application. Prelaunching the application can reduce application latency relative to waiting for the user to request to execute the application before launching the application. | 2013-07-04 |
| 20130173514 | Automated Network Disturbance Prediction System Method & Apparatus - An apparatus and method are provided for generating a prediction warning when an operational disturbance is detected in a computer, software program or in network. A classifying portion classifies problems or outages according to an impact that the problem or the outage has on the computer, software program or network. An analysis portion analyzes data and establishes links between isolated computer, software or network problems or outages, and outputs a likely cost of a future computer, software or network problem or outage. A reporting portion reports the prediction warning in response to the likelihood of the computer, software or future network problem or outage in a format that is selected based on a type of user. | 2013-07-04 |
| 20130173515 | ELECTRONIC SYNAPSES FROM STOCHASTIC BINARY MEMORY DEVICES - According to a technique, an electronic device is configured to correspond to characteristic features of a biological synapse. The electronic device includes multiple bipolar resistors arranged in parallel to form an electronic synapse, an axonal connection connected to one end of the electronic synapse and to a first electronic neuron, and a dendritic connection connected to another end of the electronic synapse and to a second electronic neuron. An increase and decrease of synaptic conduction in the electronic synapse is based on a probability of switching the plurality of bipolar resistors between a low resistance state and a high resistance state. | 2013-07-04 |
| 20130173516 | ELECTRONIC SYNAPSES FROM STOCHASTIC BINARY MEMORY DEVICES - According to a technique, an electronic device is configured to correspond to characteristic features of a biological synapse. The electronic device includes multiple bipolar resistors arranged in parallel to form an electronic synapse, an axonal connection connected to one end of the electronic synapse and to a first electronic neuron, and a dendritic connection connected to another end of the electronic synapse and to a second electronic neuron. An increase and decrease of synaptic conduction in the electronic synapse is based on a probability of switching the plurality of bipolar resistors between a low resistance state and a high resistance state. | 2013-07-04 |
| 20130173517 | METHOD AND APPARATUS FOR COORDINATING CONTENT ACROSS DEVICES BASED ON STIMULI - An approach for coordinating the rendering of related content across devices of a user based on determined environmental stimuli is described. A content provisioning platform determines one or more samples of one or more environmental signals. The content provisioning platform also processes the one or more samples to cause identification of content presented in the one or more environmental signals. Transmission of the other content to the at least one device, one or more other associated devices is then caused. | 2013-07-04 |
| 20130173518 | Simplifying Lexicon Creation in Hybrid Duplicate Detection and Inductive Classifier System - A classification system includes a signature-based duplicate detector and an inductive classifier that share attribute information. To perform the duplicate detection and the classification, the duplicate detector and inductive classifier are first initialized by generating a lexicon of attributes for the duplicate detector and a classification model for the classifier. To develop a classification model, a training set of documents of known class are used by the classifier to determine the attributes of the documents that are most useful in classifying an unknown document. The model is developed from these attributes. Attribute information containing the attributes determined by the classifier is then passed to the duplicate detector and the duplicate detector uses the attribute information to generate the lexicon of attributes. | 2013-07-04 |
| 20130173519 | Method and computer program product for providing a response to a statement of a user - A method for providing a response to a statement of a user, the method includes: receiving user input that comprises a portion of a user statement; selecting, before receiving a whole user statement, an answerable statement response between an answerable statement, multiple answerable statements and a response to an answerable statement; wherein the selecting is responsive to user input and to structured representations of answerable statements answerable by an answering entity; and sending to the user information representative of response to the user statement. | 2013-07-04 |
| 20130173520 | METHOD FOR PROVIDING WITH A SCORE AN OBJECT, AND DECISION-SUPPORT SYSTEM - The present invention is related to a method for providing with a score an object represented by a target item from a multidimensional space, said score being representative of the probability that the object satisfies a given binary property, said method being performed in a computer environment comprising processing means connected to memory means, comprising the following steps: (a) providing and storing in the memory means data representative of a set of sample items from said multidimensional space, each sample item being associated with a multi-value label representative of the probability that an object represented by said sample item satisfies the given binary property; (b) storing in the memory means data representative of the target item; (c) with said processing means, generating and storing in said memory means data representative of an oriented binary tree with a given height, said binary tree being defined by a plurality of nodes having index values in relation with their position in the binary tree, said nodes comprising a root node, intermediate nodes and terminal nodes, and each node being associated with a subspace of the multidimensional space according to the following rules: if the node is a root node, the associated subspace is the whole multidimensional subspace; if the node is a non-terminal node, its associated subspace is split into two disjoint subspaces ε | 2013-07-04 |
| 20130173521 | KNOWLEDGE BASE FOR SERVICE TICKETING SYSTEM - A knowledge base system integrates with one or more ticketing systems. In accordance with some embodiments, the knowledge base system allows support technicians to apply articles to service tickets such that uniform resource locators for the articles are stored with the other data of the service ticket and can be seen when viewing a user interface that displays service ticket data. In accordance with some embodiments, the support technician can store an article in a service ticket without viewing the article if the support technician has previously viewed the current version of the article. If the support technician has not viewed the current version of the article, the knowledge base system requires the support technician to view the article before it can be applied to a service ticket. | 2013-07-04 |
| 20130173522 | SYSTEM AND METHOD FOR APPLYING DISTINGUISHING INDICIA TO LANGUAGE IN A MODEL - The present invention is a system to apply distinguishing indicia to language in a model includes a logic analyzer and a plurality of rules utilized by the system and the logic analyzer will utilize the rules to interpret written text to be read by a computer. The a logic display component will present the rules and a formal model controller that will read the written text and pass the written text to the logic analyzer, the formal model controller displays a result using the logic display component. The rules include a plurality of Boolean operators, a plurality of ASCII operators, a plurality of Latinate, a HTML URL underscore style, a plurality of XML operators, a plurality of colors, a plurality of shapes and a plurality of different types of brackets. | 2013-07-04 |
| 20130173523 | METHOD AND SYSTEM FOR CONTEXTUAL KNOWLEDGE SOCIETY NETWORK - Aspects of the disclosure can provide a system that includes a knowledge model configured to represent a knowledge society entity with a specific context, a semantic engine, and a plurality of processors. The processors are configured to implement software instructions that instruct the semantic engine to operate a contextual knowledge society network according to the knowledge model. The knowledge model is configured to semantically represent elements and links of the elements under the specific context. | 2013-07-04 |
| 20130173524 | EXTRACTING PREDICTIVE SEGMENTS FROM SAMPLED DATA - A system and method is disclosed which predicts the relative occurrence or presence of an event or item based on sample data consisting of samples which contain and samples which do not contain the event or item. The samples also consist of any number of descriptive attributes, which may be continuous variables, binary variables, or categorical variables. Given the sampled data, the system automatically creates statistically optimal segments from which a functional input/output relationship can be derived. These segments can either be used directly in the form of a lookup table or in some cases as input data to a secondary modeling system such as a linear regression module, a neural network, or other predictive system. | 2013-07-04 |
| 20130173525 | METHODS AND APPARATUS TO CONSTRUCT HISTOGRAMS AND WAVELET SYNOPSES FOR PROBABILISTIC DATA - A disclosed example method involves generating a plurality of wavelet coefficient quantities. Each wavelet coefficient quantity is generated based on items represented by probabilistic data. Each wavelet coefficient quantity represents different ones of the items by multiplying corresponding wavelet vectors. The example method also involves determining an error measure associated with each of the plurality of wavelet coefficient quantities, and selecting at least one of the plurality of wavelet coefficient quantities based on its associated error measure. The method also involves displaying parameter information associated with the one of the plurality of wavelet coefficient quantities to represent the probabilistic data. | 2013-07-04 |
| 20130173526 | METHODS, SYSTEMS, AND MEANS FOR AUTOMATICALLY IDENTIFYING CONTENT TO BE PRESENTED - Methods, systems, and means for automatically identifying content to he presented are provided. In particular, content may he automatically identified by first determining a duration during which a user will be performing an activity and determining a mood description of the activity. Characteristics of a plurality of the entertainment content that include length of each of the plurality of entertainment content and a mood description of each of the plurality of entertainment content may be retrieved from memory. The retrieved characteristics may then be compared with the duration of the activity and the mood description of the activity. Next, entertainment content from the plurality of entertainment content to be presented during the activity may be automatically selected. Finally, the entertainment content may be presented to the user. | 2013-07-04 |
| 20130173527 | Life Cycle Management Of Rule Sets - Life cycle management of rule sets, each rule set including rules for managing the operation of a computing system, including: identifying, by a life cycle management module, a rule life cycle state for each rule in the rule set, wherein the rule life cycle state specifies the current deployment status of the rule; identifying, by the life cycle management module, a linkage set for each rule in the rule set, wherein the linkage set identifies versions of the rule that are in a different rule life cycle state; and updating, by the life cycle management module, the rule set, including: updating the rule life cycle state for one or more rules in the rule set; and updating the linkage set for one or more rules in the rule set. | 2013-07-04 |
| 20130173528 | MULTI-FACT QUERY PROCESSING IN DATA PROCESSING SYSTEM - Techniques are described for optimizing a multi-fact star schema query to retrieve data from two or more fact tables of a database. The optimization techniques may include internally transforming a received multi-fact star schema query into a group of single-fact sub-queries, thereby reducing or eliminating certain constraints during query processing. The group of sub-queries may be enumerated to determine a query execution plan. The multi-fact star schema query may be executed according to the query execution plan to retrieve the data from the two or more fact tables of the database. | 2013-07-04 |
| 20130173529 | AUTOMATED DATA ANALYSIS AND TRANSFORMATION - A transformation method and system is provided. The method includes generating a data hub application configured to embed extract, transform, and load (ETL) processes. The data hub application is linked to source tables and target tables. Meta data associated with the source and target tables is transferred from virtual views of the data hub application to an ETL work area of the ETL processes. An ETL job is generated and linked to the data hub application. ETL processes are executed and results are determined. | 2013-07-04 |
| 20130173530 | REVISION CONTROL SYSTEM AND METHOD - There is provided a file revision-control system, method and apparatus configured for storing and managing a revision history log, and for enabling to track and manage, compare and retrieve revisions including, current-revisions stored on a designated reference area, past-revisions stored in a predefined storage area and also past-revisions which were previously on a reference area. According to certain embodiments of the invention, each revision of a file is represented by a revision entry in a revision history log, which can be stored and managed in a designated data-repository. A revision entry stores data corresponding to at least one revision, while the revisions themselves may be stored on a designated data-repository. A progression path refers to one or more revision entries which represent the progression of a file over time. In case that a revision is branched into more than one revisions, each such revision will constitute a different progression path. | 2013-07-04 |
| 20130173531 | SYSTEMS AND METHODS FOR COLLABORATIVE STORYTELLING IN A VIRTUAL SPACE - User-submitted content (e.g., stories) may be associated with descriptive metadata (intersection metadata), such as a timeframe, location, tags, and so on. Story content is presented in a virtual space, such as a forum, chatroom, or the like. Users submit collaborative content as the story is presented in the virtual space. The collaborative content is synchronized to presentation of the story. An author may replay the presentation and synchronized collaborative content and/or select portions of the collaborative content for inclusion in the story. | 2013-07-04 |
| 20130173532 | Document collaborating method among multiple users - A document collaborating method among multiple users includes: for each user creating one or more types of message accounts correspondent to a username of the user, wherein each user is able to establish contacts or a collaborative group thereof; allocating a document initial version number to one or more documents which the user shares with the contacts or the collaborative group, saving an initial version of the document and then setting correspondent sharing permission and sharing time limit; and after finishing setting the sharing permission and the sharing time limit, automatically sending notification messages to the correspondent contacts or the correspondent collaborative group for readily notifying by the message account, and regularly reminding the sharing users to notice the time limit according to the sharing time limit by the message accounts of all sharing users of the shared document. | 2013-07-04 |
| 20130173533 | SYSTEMS AND METHODS FOR SHARING PROFILE INFORMATION USING USER PREFERENCE TAG CLOUDS - Systems and methods for sharing user profile information using tag clouds are provided in accordance with various embodiments of the present invention. A first tag cloud may be generated from attributes stored in a first user profile and a second tag cloud may be generated from attributes stored in a second user profile. A user may drag-and-drop attributes between the two tag clouds and, in response, the underlying user profiles may be updated. Tag clouds may thus present a user's media preferences in an attractive and compelling visual arrangement that, in some embodiments, also functions as an intuitive interface for copying preferences between user profiles. | 2013-07-04 |
| 20130173534 | TELEPHONE NUMBER USE ANALYSIS FOR GROUPS OF TELEPHONE NUMBERS - A system may include a network device including a memory. The memory may store a first database including a plurality of records, wherein each record in the first database stores a telephone number (TN) and a status of the corresponding TN. the first database may stores information to indicate whether one of the records in the first database was updated. The memory may store a second database having a plurality of records. Each record in the second database may indicate a range of consecutive TNs from the first database having a same status. The system may include processors to run a first thread to update the one of the records in the first database. The processors may run a second thread to generate the second database from the first database in response to the stored information indicating that the one of the records in the first database was updated. | 2013-07-04 |
| 20130173535 | ON-LINE INVENTION DISCLOSURE APPROVAL SYSTEM - An on-line invention disclosure system includes a user computer ( | 2013-07-04 |
| 20130173536 | DISTRIBUTED INDEXING SYSTEM FOR DATA STORAGE - A distributed indexing system spreads out the load on an index of stored data in a data storage system. Rather than maintain a single index, the distributed indexing system maintains an index in each media agent of a federated data storage system and a master index that points to the index in each media agent. In some embodiments, the distributed indexing system includes an index server (or group of servers) that handles indexing requests and forwards the requests to the appropriate distributed systems. Thus, the distributed indexing system, among other things, increases the availability and fault tolerance of a data storage index. | 2013-07-04 |
| 20130173537 | MANAGING REMOTE DATA REPLICATION - Various systems, processes, and products may be used to manage remote data replication. In particular implementations, a system and process for managing remote data replication may include the ability to store versions of a disk at a first site, a second site, and a third site. The version of the disk at the first site may store input/output for a host system, the version at the second site may be a synchronous replication of the version at the first site, and the version at the third site may be an asynchronous replication of the version at the first site. The system and process may also include the ability to synchronize the version at the first site with the version at the third site if the second site is unavailable and synchronize the version at the second site with the version at the third site if the first site is unavailable. | 2013-07-04 |
| 20130173538 | MANAGING REMOTE DATA REPLICATION - Various systems, processes, and products may be used to manage remote data replication. In particular implementations, a system and process for managing remote data replication may include the ability to store versions of a disk at a first site, a second site, and a third site. The version of the disk at the first site may store input/output for a host system, the version at the second site may be a synchronous replication of the version at the first site, and the version at the third site may be an asynchronous replication of the version at the first site. The system and process may also include the ability to synchronize the version at the first site with the version at the third site if the second site is unavailable and synchronize the version at the second site with the version at the third site if the first site is unavailable. | 2013-07-04 |
| 20130173539 | REMOTE DATA COLLECTION SYSTEMS AND METHODS USING READ ONLY DATA EXTRACTION AND DYNAMIC DATA HANDLING - Remote data collection systems and methods retrieve data including financial, sales, marketing, operational and the like data from a plurality of databases and database types remotely over a network in an automated, platform-agnostic manner. A remote data collection system includes a network interface, a connection to a data source, a processor communicatively coupled to the network interface and the connection, and memory storing instructions for remote data collection that, when executed, cause the processor to: receive a request to extract data from the data source; extract the data in a non-intrusive manner from the data source using a two phase process comprising a reconciliation phase and a collection phase; and transmit one of an entire set and a subset of the extracted data based on the request. | 2013-07-04 |
| 20130173540 | GATHERING TRANSACTION DATA ASSOCIATED WITH LOCALLY STORED DATA FILES - Systems and methods are provided for enabling local storing of one or more portions of a data file and recording changes to contents of the data file. In some embodiments, a first data file may be sent to a client system, along with a script to manage the first data file. Changes to the data file may be stored locally, and may then be sent to a remote server upon network reconnection. | 2013-07-04 |
| 20130173541 | DATABASE VERSION MANAGEMENT SYSTEM - Systems and methods for managing versions of a database are described herein. The system includes a worklist module configured to receive a plurality of change requests and generate a first worklist based on them. The plurality of change requests include instructions for modifying one of a database structure and/or master data of the database. One or more change requests may be approved from the first worklist. The worklist module generates a second worklist comprising the approved change requests. One or more change requests included in the second worklist are executed to create a version of the database. A versioning module may maintain and track a plurality of versions within the database. A comparison module may allow comparison and synchronization of the plurality of versions of the database based on the results of comparison and needs in specific environment. | 2013-07-04 |
| 20130173542 | REPLICATION OF DATA SETS - An approach that allows for replicating data sets that have different attributes. A logical copy operation may not be possible from a source data set to a target data set due to differences between their respective attributes. The source data set may have obsolete attributes that prevent a logical copy to a target data set with supported attributes. The presented solution may involve allocating an intermediate data set with the same attributes as the source data set. The intermediate data set may be allocated with the same obsolete attributes as the source data set. The approach may also involve executing a logical copy operation from the source data set to the intermediate data set. A standard copy operation that reformats the data may be executed on the intermediate data set to the target data set. | 2013-07-04 |
| 20130173543 | MATERIALIZED QUERY TABLE JOURNALING IN A COMPUTER DATABASE SYSTEM - An apparatus and method utilize MQTs in a more efficient manner in a high availability computer database to improve database performance and utility. In preferred embodiments, an MQT control file indicates whether journal entries for specific tables are to be propagated to replicated databases residing on other computer servers. In other embodiments, the MQT control file includes metrics that are used to control when the propagation is turned on and off. | 2013-07-04 |
| 20130173544 | MATERIALIZED QUERY TABLE JOURNALING IN A COMPUTER DATABASE SYSTEM - An apparatus and method utilize MQTs in a more efficient manner in a high availability computer database to improve database performance and utility. In preferred embodiments, an MQT control file indicates whether journal entries for specific tables are to be propagated to replicated databases residing on other computer servers. In other embodiments, the MQT control file includes metrics that are used to control when the propagation is turned on and off. | 2013-07-04 |
| 20130173545 | FILE-BACKED IN-MEMORY STRUCTURED STORAGE FOR SERVICE SYNCHRONIZATION - Providing synchronization to a local system. Embodiments may include downloading a batch of changes in a heterogeneous batch. The batch of changes is correlated to an anchor affiliated with a synchronization service. The anchor is a reference point indicating time or relative order. The batch of changes and the anchor are serialized to a non-volatile storage medium as a heterogeneous set. After serializing the batch of changes to a non-volatile storage medium as a heterogeneous set, entities in the batch of changes are parsed out into entities in in-memory representations. Similarly, embodiments may receive user input modifying a plurality of data entities, store on a non-volatile storage medium a serialized heterogeneous representation of the modified data entities, and upload the serialized heterogeneous representation to a synchronization service. | 2013-07-04 |
| 20130173546 | SYSTEMS AND METHODS FOR MIGRATING DATABASE DATA - In one general aspect, a computer-implemented method for migrating data from a source database to a target database includes a computer-implemented method that includes executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium. The method includes ensuring that the source database has correct version information, creating an image copy of the data in the source database, and collecting metadata describing the source database. The metadata may include information used to verify that the target database is compatible with the source database, to automatically translate object identifiers, and to avert the migration if no data has changed in the source and the target databases (e.g., table and index spaces) since a previous migration. The method may further include refreshing the data in the target database using the image copy after determining that the source database and the target database are compatible. | 2013-07-04 |
| 20130173547 | SYSTEMS AND METHODS FOR MIGRATING DATABASE DATA - In one aspect, a computer-implemented method for ensuring a source database (e.g., target space or index space) has correct version information before a migration includes executing, using at least one processor, instructions recorded on a computer-readable storage medium. The instructions include determining whether a table has been changed since a most recent alter of the table, performing an update on the table when it is determined that the table has not been changed since the most recent alter, and performing a rollback on the table after the update. The method may also include creating an image copy of the data in the source database and refreshing data in a target database with the image copy of the data in the source database. The method may also include automatically repairing the target database when the version information of the target does not correspond with the version information for the source. | 2013-07-04 |
| 20130173548 | METHOD AND SYSTEM FOR BACKUP AND RECOVERY - For data backup and recovery based on linked file repositories with each of the linked file repositories representing an individual file system capable of storing at least one version of a file and being connected to at least one server system, each of the linked file repositories are placed in a certain position for storing a certain version of the file. Each position of each of the linked file repositories is continuously numbered. A number of the versions of the file are determined by the position of the one of the linked file repositories. A version-movement process over each of the linked file repositories is implemented to perform a read operation of the at least one version of the file. | 2013-07-04 |
| 20130173549 | Declarative View Objects - A view object is generated in a target deployment unit in a design time environment of a metadata repository. The view object is modeled on a business object of a source deployment unit. The source deployment unit includes process components of a business application that is physically decoupled from the target deployment unit. A subset of attributes of the business object of the source deployment unit is selected. The subset of attributes includes at least an outbound agent and an inbound agent implemented by a generic messaging framework. The view object is modeled in the target deployment unit with the subset of attributes of the business object. The inbound agent of the view object is configured for receiving a replication message from the outbound agent of the business object, and the replication message includes replication data for configuring the view object only with data from the business object. | 2013-07-04 |
| 20130173550 | FILE SYSTEM QUIESCING DRIVER - A technique is disclosed for quiescing a file system. The technique includes holding a change request, flushing the file system, and releasing the change request. Flushing may include sending a flush request, determining whether a cache associated with the file system is flushed, and in the event that the cache is not flushed, resending the flush request and determining whether the cache is flushed. | 2013-07-04 |
| 20130173551 | FAST SNAPSHOTS - A fast snapshot is configured to store a state of a computing environment at a point in time. The fast snapshot operation is performed by avoiding reference counts of one or more data units associated with the snapshot from being updated at a creation and a deletion time. | 2013-07-04 |
| 20130173552 | SPACE EFFICIENT CASCADING POINT IN TIME COPYING - Embodiments for space-efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time, are provided. Data is physically copied form the source to a repository to create a physical copy, and a data mapping is created that associates the physical copy with a most recent target copy. | 2013-07-04 |
| 20130173553 | Distributed Scalable Deduplicated Data Backup System - A distributed, cloud-based storage system provides a reliable, deduplicated, scalable and high performance backup service to heterogeneous clients that connect to it via a communications network. The distributed cloud-based storage system guarantees consistent and reliable data storage while using structured storage that lacks ACID compliance. Consistency and reliability are guaranteed using a system that includes: 1) back references from shared objects to referring objects, 2) safe orders of operation for object deletion and creation, 3) and simultaneous access to shared resources through sub-resources. | 2013-07-04 |
| 20130173554 | COMPUTER PRODUCT, BACKUP CONTROL METHOD, AND BACKUP CONTROL DEVICE - A computer-readable recording medium stores a program that causes a computer to execute a backup control process that includes transmitting to a controlled device, a backup command to back up target data stored in the controlled device having a backup unit that backs up data while associating the data with identification information of duplicated data that is a copy of the data, and a transmission request to transmit duplicated data of the target data; and storing the duplicated data to a storage unit while associating the duplicated data with the identification information concerning the duplicated data upon receiving the duplicated data and the identification information concerning the duplicated data as a result of transmitting the backup command and the transmission request. | 2013-07-04 |
| 20130173555 | Reducing a Backup Time of a Backup of Data Files - A mechanism is provided for reducing the backup time of data files from a memory. Data files are pre-staged by identifying the data files in the memory to be backed up to a backup storage system, sorting the data files by size thereby forming a set of small data files and a set of large data files, and copying the set of small data files to a cache while leaving the set of large data files in a disk subsystem. The set of small data files are then backed-up from the cache and the set of large data files are backed-up from the disk subsystem to a backup storage system. Thus, the time required to backup the set of small data files from the cache is performed at a faster rate as compared to backing up the set of large data files from the disk subsystem. | 2013-07-04 |
| 20130173556 | MOBILE DEVICE DATA ARCHIVING - Mobile devices such as cell phones, “smart” phones, personal data assistants (PDA's) and the like are equipped for accessing and storing all types of media, including movies, music, software applications, as well as copious amounts of associated data. Accordingly, a need exists for methods, apparatuses and computer program products that assist mobile device users in archiving data, configuring the data, and restoring the data to the same device, or a new mobile device running the same or different operating system. Embodiments of the claimed invention address the above needs and/or achieve other advantages by providing systems for archiving data on a mobile electronic device on a plurality of data storage media, and by providing similar means of restoring the archived data to the same or different mobile device. | 2013-07-04 |
| 20130173557 | Data Archiving and De-Archiving in a Business Environment - A computer implemented method for data archiving and dearchiving in a business environment is described herein. According to an implementation, the method includes obtaining metadata configuration associated with a source database storing transaction information, the transaction information being related to a business transaction. Based on the metadata configuration an archive specification is generated. Further, based on the archive specification and the metadata configuration, an archive mapping is configured. According to an aspect, the archive mapping is synchronized with an update in one of the metadata configuration. The archive mapping can be implemented for archiving the transaction information. Additionally, the archived transaction information can be de-archived, or can be purged onto a back-up repository. | 2013-07-04 |
| 20130173558 | DATABASE RECOVERY PROGRESS REPORT - The present description refers to a computer implemented method, computer program product, and computer system for receiving a start time, selecting one or more database objects for which a database recovery progress report is to be provided, determining, based on an object recovery table generated by the database recovery utility, which of the selected database objects have been recovered since the start time, and outputting a database recovery progress report that identifies at least a number or percentage of the selected database objects that have been recovered by the database recovery utility since the start time. | 2013-07-04 |
| 20130173559 | ELECTRONIC DEVICE, STORAGE MEDIUM, AND METHOD FOR RECOVERING DELETED FILES OF THE ELECTRONIC DEVICE - In a method to recover deleted files of an electronic device, properties of a file are stored into a file list of a storage system of the electronic device when the file is deleted from the electronic device. The method compresses the deleted file, and stores the compressed file in a hidden partition of the storage system. The method further obtains the compressed file from the hidden partition when the deleted file needs to be recovered. Then, the method decompresses the compressed file, and stores the decompressed file to an active partition in the electronic device. | 2013-07-04 |
| 20130173560 | DYNAMIC RECORD BLOCKING - Dynamic blocking determines which pairs of records in a data set should be examined as potential duplicates. Records are grouped together into blocks by shared properties that are indicators of duplication. Blocks that are too large to be efficiently processed are further subdivided by other properties chosen in a data-driven way. We demonstrate the viability of this algorithm for large data sets. We have scaled this system up to work on billions of records on an 80 node Hadoop cluster. | 2013-07-04 |
| 20130173561 | SYSTEMS AND METHODS FOR DE-DUPLICATION IN STORAGE SYSTEMS - In accordance with embodiments of the present disclosure, a storage system may include a storage array comprising one or more storage resources, a processor communicatively coupled to the storage array, and a de-duplication module comprising instructions embodied on a computer-readable medium communicatively coupled to the processor. The de-duplication module may be configured to, when read and executed by the processor: generate a fingerprint for an item of data stored on the storage array; identify a partition for the fingerprint; associate the partition with a hardware instance selected from a plurality of hardware instances, wherein each particular hardware instance comprises one or more information handling resources; and query the selected hardware instance to determine if the fingerprint exists on the hardware instance. | 2013-07-04 |
| 20130173562 | Simplifying Lexicon Creation in Hybrid Duplicate Detection and Inductive Classifier System - A classification system includes a signature-based duplicate detector and an inductive classifier that share attribute information. To perform the duplicate detection and the classification, the duplicate detector and inductive classifier are first initialized by generating a lexicon of attributes for the duplicate detector and a classification model for the classifier. To develop a classification model, a training set of documents of known class are used by the classifier to determine the attributes of the documents that are most useful in classifying an unknown document. The model is developed from these attributes. Attribute information containing the attributes determined by the classifier is then passed to the duplicate detector and the duplicate detector uses the attribute information to generate the lexicon of attributes. | 2013-07-04 |
| 20130173563 | RELIABILITY OF DUPLICATE DOCUMENT DETECTION ALGORITHMS - In a single-signature duplicate document system, a secondary set of attributes is used in addition to a primary set of attributes so as to improve the precision of the system. When the projection of a document onto the primary set of attributes is below a threshold, then a secondary set of attributes is used to supplement the primary lexicon so that the projection is above the threshold. | 2013-07-04 |
| 20130173564 | SYSTEM AND METHOD FOR DATA COMPRESSION USING MULTIPLE ENCODING TABLES - A system and method for compressing and decompressing multiple types of character data. The system and method employ multiple encoding tables, each designed for encoding a subset of character data, such as numeric data, uppercase letters, lowercase letters, Latin, or UNICODE data, to perform compressions and decompression of character data. The character encoding tables are smaller than the size of the alphabet of the uncompressed strings. | 2013-07-04 |
| 20130173565 | FINDING SUSPICIOUS ASSOCIATION RULES IN DATA RECORDS - Suspicious activity may be found by automated methods and systems that analyze data records to find association rules correlating values in the fields of the records and then analyzing the association rules, as the association rules themselves can be indicative of improprieties. Thus, minimal human intervention is used to find improprieties in even very large datasets. If the data records are records of sales transactions, the finding and the analyzing of association rules as disclosed can flag suspicious-appearing transactions that may have resulted from improprieties, such as human mistakes or intentional frauds. Instructions for performing the disclosed analyses may be stored on non-transitory storage media for access by systems to execute the automated methods. | 2013-07-04 |
| 20130173566 | STRUCTURED TEST ADHERENCE MANAGEMENT FOR MANUAL DATA ENTRY SYSTEMS - A computer-implemented method is provided for managing manual entries of blood glucose measures for a patient in relation to a structured collection procedure managed by a portable computing device. The method includes: managing a structured collection procedure for a user of the computing device, where the structured collection procedure specifies one or more collection events for obtaining blood glucose measures for a patient; receiving a data entry for a blood glucose measure from the user of the computing device; evaluating the data entry in relation to the structured collection procedure using a membership rule set, where the membership rule set defines rules for associating data entries with structured collection procedures; and inputting the data entry into a logbook residing in a data store on the computing device. Depending upon the evaluation, the data entry may be input with or without an association to the structured collection procedure. | 2013-07-04 |
| 20130173567 | DEFERRED RELEASE PROCESSING WITHOUT DATABASE RECORD LOCKING - Performance in databases stored over multiple host computer systems may be improved by writing and releasing records without locking the records. An attribute flag may be set on certain records in a database to indicate to the database that the records may be written and released without locking the records. When the attribute flag is set, the record may be processed during deferred processing by writing a free bit pattern and releasing the record without locking the record. | 2013-07-04 |
| 20130173568 | METHOD OR SYSTEM FOR IDENTIFYING WEBSITE LINK SUGGESTIONS - Methods and systems are provided that may be utilized to generate website link suggestions. | 2013-07-04 |
| 20130173569 | COLLABORATIVE SEARCHING - A collaborative search session is provided hosted by one or more computing devices. First query data is received from a first computing device in a collaborative search session. Further, second query data is received from a second computing device in the collaborative search session. A corpus of resources can be caused to be searched based at least in part on the first and second query data to identify a particular search result set for the collaborative search session. At least a portion of the particular search result set can be caused to be presented on each of the first and second computing devices participating in the collaborative search session. | 2013-07-04 |
| 20130173570 | PRESENTING INTERACTIVE IMAGES WITH SEARCH RESULTS - Systems, methods, and computer-readable storage media for presenting interactive images associated with a search engine in association with a search engine results page (SERP) are provided. Upon receiving a search query at a search engine, it is determined that the search query content has a related interactive image associated with the search engine. An interactive image may be associated with the search engine, for instance, by having been previously presented as a background image for a search engine home page. A link to the interactive image may be presented as a search result on the SERP, the interactive image may be automatically presented as a background image of the SERP, or the interactive image may be determined to be related to an algorithmically-derived search result and a visual indicator thereof may be presented in association with the search result. | 2013-07-04 |
| 20130173571 | CLICK NOISE CHARACTERIZATION MODEL - The techniques discussed herein consider a degree of noise associated with user clicks performed during search sessions. The techniques then generate a model that characterizes click noise so that search engines can more accurately infer document relevance. | 2013-07-04 |
| 20130173572 | LEVERAGING AFFILIATIONS TO PROVIDE SEARCH RESULTS - Information from social networks may be used to identify a user's interests and predilections, and the information may be used to affect search results. In one example, social networks have pages that correspond to real entities, such as manufacturers and merchants. Entity pages in social networks are mapped to their corresponding real entities, and information that users leave on the pages (e.g., “likes”, or textual reviews) are extracted to determine users' sentiments about the entities. When users search for products with a search engine, user sentiment is then used to guide the results. Social networks' information about users (e.g., their affinities, such as schools, workplaces, interests) may be used to determine the relevance of specific users' sentiments—e.g., sentiments of users who went to a particular school may be used to influence search results, when the search is requested by someone who went to the same school. | 2013-07-04 |
| 20130173573 | Search Engine Performance Evaluation Using a Task-based Assessment Metric - The subject disclosure is directed towards evaluating search engine implementation performance using a task-based assessment metric. Logged user activities associated with the search engine implementation are processed into sessions and atomic events corresponding to the user activities within the sessions. The atomic events corresponding to the user activities are classified into tasks based on similarity of the queries within the user activities. After applying the task-based assessment metric to task information associated with the search engine implementation, an evaluation mechanism determines indicia of search engine implementation performance in terms of user behavior. | 2013-07-04 |
| 20130173574 | SEARCH ENGINE OPTIMIZATION WITH SECURED SEARCH - One example includes a method of attributing revenue to keywords for an entity having an entity website. The method may include obtaining the keywords used in a secured search on a search engine that result in a visit to an entity website and determining a position or rank of a webpage of the website on a search results page resulting from searching the keyword. The method may further include estimating, based on the rank of the webpage, a number of visits to the website that result from secured searches of the keyword. | 2013-07-04 |
| 20130173575 | METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT PROVIDING LOCAL SERVICE DISCOVERY WITH BROWSER SEARCH - Embodiments of the invention provide in part a method to conduct a search for information in a network. The method includes operating a user interface of a device to initiate the sending of a search request via a first channel; and indicating via the user interface selectively whether received information from at least one local source via a second channel is to be included as at least a part of the search. The embodiments of the invention further provide a node of a communication system, where the node includes a transmitter for communicating to a receiver of a device during mobility of the device, and where the node is operable for transmitting a predetermined search word set to the receiver for use by the device for composing a search request to a search engine. | 2013-07-04 |
| 20130173576 | ENHANCED DOCUMENT BROWSING WITH AUTOMATICALLY GENERATED LINKS TO RELEVANT INFORMATION - Additional documents are automatically located that are relevant to an original document, such as a document being read by a user, and also potentially relevant to personal information of the user. The additional documents may be located based on descriptive information that includes personal information of the user and content information of the document being read. The additional documents, or links to the additional documents, may be incorporated into the document being read. In some implementations, the additional documents may be presented in-line with the document being read, such as through an in-link link or text snippet. The user can thus be efficiently presented with additional information that is relevant to the original document being read. | 2013-07-04 |
| 20130173577 | Location-Based Searching Using a Search Area That Corresponds to a Geographical Location of a Computing Device - In general, the subject matter described in this specification can be embodied in methods, systems, and programs for providing location-based information. A geographical location of a mobile computing device is received at a server system. A request for content is received at the server system and from the mobile computing device. A search area that corresponds to the geographical location is selected by the sever system. The search area is selected from among a collection of search areas that correspond to the geographical location. At least one of the search areas in the collection is geographically nested within at least one other of the search areas. A search result that is most-relevantly ranked for the selected search area is determined by the server system. Content that represents the determined search result is provided by the server system and for receipt by the mobile computing device. | 2013-07-04 |
| 20130173578 | METHODS AND APPARATUSES FOR SEARCHING CONTENT - Embodiments of methods and apparatuses for searching contents, including structured search for atomic search expressions, including proximately associated atomic search expressions, are described herein. Embodiments may use tree structures (or more generally, graph structures), layout structures, and/or other information to capture within search results relevant content, include sub-document constituents, to reduce the incidence of false positives within search results, and/or to improve the accuracy of rankings within search results. Embodiments may use distance and/or scoring functions to generate scores for the structures to indicate relevance, including usage of local geometry, and linear iteration over portions of the content at a level to capture potential of a portion to influence other portions of the level, and influence received by a portion from the other portions of the level. Other embodiments may be described and claimed. | 2013-07-04 |
| 20130173579 | SCENARIO-BASED CRAWLING - An interactive session can be established between a crawling bot and a Web site. The crawling bot can defines a session state representing a user state for interacting with one or more Web sites, a set of conditions, and a set of scenarios to be selectively activated based on whether the set of conditions are satisfied. The crawling bot can receive content from the Web site during the interactive session. The crawling bot can parse the content from the Web site and can matching the parsed content against a previously defined set of items to determine whether the content matching condition is satisfied. If the content matching condition is satisfied and if the state condition is satisfied, the crawling bot, activating of the scenarios defined by the crawling bot can be active, which is not activated if the content matching condition and the state condition are not satisfied. | 2013-07-04 |
| 20130173580 | SCENARIO-BASED CRAWLING - An interactive session can be established between a crawling bot and a Web site. The crawling bot can defines a session state representing a user state for interacting with one or more Web sites, a set of conditions, and a set of scenarios to be selectively activated based on whether the set of conditions are satisfied. The crawling bot can receive content from the Web site during the interactive session. The crawling bot can parse the content from the Web site and can matching the parsed content against a previously defined set of items to determine whether the content matching condition is satisfied. If the content matching condition is satisfied and if the state condition is satisfied, the crawling bot, activating of the scenarios defined by the crawling bot can be active, which is not activated if the content matching condition and the state condition are not satisfied. | 2013-07-04 |
| 20130173581 | SCENARIO-BASED CRAWLING - An interactive session can be established between a crawling bot and a Web site. The crawling bot can defines a session state representing a user state for interacting with one or more Web sites, a set of conditions, and a set of scenarios to be selectively activated based on whether the set of conditions are satisfied. The crawling bot can receive content from the Web site during the interactive session. The crawling bot can parse the content from the Web site and can matching the parsed content against a previously defined set of items to determine whether the content matching condition is satisfied. If the content matching condition is satisfied and if the state condition is satisfied, the crawling bot, activating of the scenarios defined by the crawling bot can be active, which is not activated if the content matching condition and the state condition are not satisfied. | 2013-07-04 |
| 20130173582 | INDEXING SECURE ENTERPRISE DOCUMENTS USING GENERIC REFERENCES - A web crawler indexes documents including information about document contents and metadata including information such as a URL. However, some applications rely on URL's that change frequently or are constructed to include user information so that the contents retrieved is customized to the user. An approach is provided for storing generic URL's in an index at crawl time, which are customized for the user at search time. A callback mechanism may be used to dynamically transform the generic URL into a URL that is specific to the user issuing the query and/or includes current information that may change frequently. In this way, when the query or search results are returned to the user, the user receives links that are active and valid for that particular user, directing the user to the appropriate site, application, etc. without requiring continuous updating of a very large index. | 2013-07-04 |
| 20130173583 | KEYWORD INDEX PRUNING - A system and method is disclosed for profiling a subject's search engine keywords and results based on relevancy feedback. Because the system is based on the search behavior of the user, the profiling is language independent and balances the specificity of search terms against the profiled interests of the user. The system can also score keywords on their search effectiveness and eliminate ineffective keywords from the keyword index. The system can also synthesize new keyword combinations to assist the user in refining the search or acquiring related content. The system has application in text mining, personalization, behavioral search, search engine optimization, and content acquisition, to name but a few applications. | 2013-07-04 |
| 20130173584 | DELTA MEASURES - A system may include reception of a selection of a set of one or more elements of a data visualization, the set associated with a measure and each of the one or more elements associated with a value of the measure for a respective combination of one or more dimension members, reception of an instruction to create a second set of one or more elements associated with a calculated measure, where a value of the calculated measure for a respective combination is based on two values of the measure for the respective combination, and where a first value of the two values of the measure is associated with a first time and a second value of the two values of the measure is associated with a second time, and automatic generation of a query to produce the value of the calculated measure for each of the combinations | 2013-07-04 |
| 20130173585 | OPTIMIZING MAP/REDUCE SEARCHES BY USING SYNTHETIC EVENTS - A processor-implemented method, system, and/or computer program product optimizes a search for data from documents. A processor receives an instruction to perform an initial map/reduce search for a specific set of data in documents from a first database. A synthetic event, which is a non-executable descriptor of the specific set of data in documents from the first database, is generated, and a revised map/reduce search for the synthetic event in a second database is conducted. The processor then returns a solution for the revised map/reduce search. | 2013-07-04 |
| 20130173586 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR REDUCING RESPONSE TIME VARIATION IN A WORKLOAD MANAGEMENT SYSTEM - A system, method, and computer readable medium are provided for reducing response time variation in a workload management system for a database system. When a query response is generated in response to a database query from a client, a determination may be made as to whether response time of the query response is less than a predetermined amount of time. Delivery of the query response to the client is delayed when an amount of time associated with the query response is less than the predetermined amount of time. | 2013-07-04 |
| 20130173587 | METHOD FOR PROCESSING STREAM DATA AND SYSTEM THEREOF - A network interface receives stream data and a processor processes the stream data. The processor: constructs an operator graph comprising information regarding a plurality of operators for processing the stream data based on a query; assigns an operator execution order to the plurality of operators based on an inter-operator input and output relation, with respect to all of the operators on the operator graph; extracts a set of the operators that maintains the stream data assigned with a time stamp, a time of which is earlier than or equal to a reference time, in an input queue; and executes processing of the stream data assigned with the time stamp, having the earliest time, in the operator assigned a minimum operator graph execution order among the operators and maintaining the stream data assigned with the time stamp having the earliest time, among the extracted set of the operators. | 2013-07-04 |
| 20130173588 | TECHNIQUES FOR UPDATING JOIN INDEXES - Techniques for updating join indexes are provided. A determination is made to update date criteria in a join index query statement. The join index is parsed for current date and current time criteria. The join index is revised based on the location of the current date and current time criteria as they appear in the original join index. The revisions include new criteria that minimize the effort in maintaining and using the join index. | 2013-07-04 |
| 20130173589 | TECHNIQUES FOR OPTIMIZING OUTER JOINS - Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query. | 2013-07-04 |
| 20130173590 | OPTIMIZING NESTED DATABASE QUERIES THAT INCLUDE WINDOWING OPERATIONS - A nested database query can be optimized by effectively representing a filtering function or operation (e.g., SQL filtering operation) of its outer sub-query by a qualification or qualify operation (e.g., SQL qualification operation) associated with at least one windowing function of at least one of its inner sub-queries. It will be appreciated that this representation can yield a modified query that would be equivalent (e.g., semantically equivalent) to the original nested query as its execution can produce the same results when optimization rules are applied. | 2013-07-04 |
| 20130173591 | DATA SCHEMA AND LANGUAGE - A system includes reception of a logical schema associated with a data store, generation of an input schema based on the logical schema, reception of an expression having a type of the input schema and representing the topology of a data set, the data set being an instance of the input schema, compilation of the expression to a data specification based on the input schema, and generation of a plan to execute on the data store based on the data specification. | 2013-07-04 |
| 20130173592 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR OPTIMIZING DATABASE QUERIES WHICH USE SPOOLS DURING QUERY EXECUTION - A database system comprises a processing module, and a storage device communicatively coupled with the processing module and allocated thereto. The storage device stores a base table allocated to the processing module. The processing module receives a database query from a client computer system, and generates a spool based upon a number of columns of a table, and partitions at least one column of the spool based upon the database query received from the client computer system. | 2013-07-04 |
| 20130173593 | BREADCRUMB FILTERING - A first search result page is displayed and includes a plurality of items and a hierarchical list of categories. The hierarchical list of categories is such that each of the plurality of items falls within all of the categories in the hierarchical list of categories. The plurality of items includes only items that match a search criteria entered in a search box. An indication that a category in the hierarchical list of categories has been selected is received. In response, a second search result page is displayed and includes a second plurality of items that fall within the selected category. The second plurality of items includes only items that match the search criteria. At least one item of the second plurality of items was not displayed in the first search result page. | 2013-07-04 |
