Patent classifications
G06F16/2291
METHOD FOR EXTRACTING SAME-STRUCTURED DATA, AND APPARATUS USING SAME
The present invention provides a method for extracting same-structured data, the method comprising the steps of: obtaining, by a computing device, text information corresponding to an attribute value of an object corresponding to a search target; searching for each of a plurality of tags included in a body range, and identifying a specific tag included in a specific tag aggregate and corresponding to the text information; when the specific tag does not have a sibling tag in another tag aggregate, searching for a specific item tag which i) is included in the specific tag aggregate, ii) corresponds to an upper tag of the specific tag, and iii) has a sibling tag in the other tag aggregate; and obtaining a plurality of predetermined tag aggregates, which are included in the body range while including an item tag corresponding to a sibling tag of the specific item tag, as an uppermost tag, and displaying a plurality of predetermined objects corresponding thereto.
GENERATING DERIVED DIMENSIONS TO MODIFY DATA COLLECTION SCHEMAS WITHOUT ADDITIONAL DATA INGESTION
The present disclosure relates to systems, non-transitory computer-readable media, and methods for generating derived dimensions within ingested data collections. In particular, in one or more embodiments, the disclosed systems generate derived dimensions that modify or correct one or more organizational schemas of an ingested data collection when querying the ingested data collection. For example, the disclosed systems receive a user-defined definition, and generates a fallback expression based on the user-defined definition and aligned to the schema of a particular ingested data collection. In at least one embodiment, the disclosed systems generate the derived dimension by identifying and modifying one or more existing dimensions in the schema based on the fallback expression when reading data from the ingested data collection.
Methods and systems for creating and managing micro content from an electronic document
Systems and methods are disclosed herein for processing one or more document and/or hierarchal project. For example, a system is disclosed having memory storing the document as a data file comprising content data. The system also includes at least one processor coupled to the at least one memory and configured to designate a portion of the content data as micro content; receive user input providing a phrase; and generate a phrase map configured to associate the phrase with the designated micro content and store the phrase map as phrase map data, the phrase map data comprising at least the phrase associated with a reference indicative of the associated micro content.
Decoding a route encoded by a probabilistic encoding data structure
A mobile apparatus receives a route response including information identifying a starting location and a target location of a route and an encoding data structure encoding the route. The encoding data structure is a probabilistic data structure configured to not provide false negatives. The mobile apparatus uses the information identifying the starting and target locations to identify a decoded origin traversable map element (TME) and a decoded target TME of the mobile version of the digital map for the route; accesses map information for determining a cost value for TMEs of the digital map, wherein a TME that satisfies the encoding data structure is assigned a minimal cost value; determines a decoded route from the decoded starting TME to the decoded target TME based on the cost value assigned to the TMEs using a cost minimization route determination algorithm; and performs at least one navigation function using the decoded route.
ALGORITHM FOR DATES RANGE LAYERS FOR HISTORICAL DATA
The present invention is an algorithm for storing and accessing historical data, using dates range layers. This approach is intended to aggregate almost any kind of historical data such as but not limited to web server logs, network traffic, finance transactions, marketing data, or sports statistics into dates range layers which can be saved into almost any data storage making it easily accessible as quickly as possible without extra calculations.
Method and system for encapsulating and storing information from multiple disparate data sources
An example computer-implemented method and computer system, each adapted for encapsulating digital data records in multiple, differently structured and unstructured formats, the data records ingested from multiple data storage locations, is described herein. In the method, each ingested data record is separated into a plurality of tuple structures, and for each tuple, the tuple is split into a data part and fieldname part. A pointer is created by combining the fieldname part, a record identifier of the data record, and a database identifier of the storage location where the data record was stored. The pointer is appended to the data part to form a digital stem cell (DSC) that is stored in a single data store, each formed DSC having the same structure.
GENERATING SHORTCUT PATHS BETWEEN RELATED DATA TYPES
Embodiments are directed to managing data. A data model that includes data types, data type relationships, shortcuts may be provided. In response to a query for determining a directed path in the data model for a shortcut further actions may be performed including: determining candidate nodes and traversal edges based on the data model, a target data type, and a source data type;
generating a tree based on the candidate nodes and the traversal edges; removing leaf nodes of the tree that are not the target data type; removing duplicate branches of the tree that correspond to duplicate traversal edges; determining the directed path in the data model connecting the source data type to the target data type based on the remaining candidate nodes and traversal edges; and generating a response to the query based on the directed path.
Method and device of storing data object
A method of storing a data object includes dividing data of a data object into a first part of data and a second part of data, in response to receiving a writing request for a data object, the first part of data including a data field of the data object, the second part of data including a meta data of the data object; writing the first part of data into a first data file stored in a first external storage device; and writing, into a second data file stored in a second external storage device, first location information, and the second part of data, the first location information including location information of the first part of data within the first external storage device.
SALES ATTEMPT TRACKING IN CUSTOMER RELATIONSHIP MANAGEMENT PLATFORM
A customer relationship management (CRM) platform may use a sales opportunity object to store information about a particular sales opportunity. However, if the life cycle of the sales opportunity involves multiple distinct sales attempts separated by dormant periods, the CRM platform can store historical data associated with one or more earlier sales attempts in sales attempt objects linked to the sales opportunity object. By storing historical data associated with previous sales attempts in linked sales attempt objects, the CRM platform can retain the historical data while allowing the sales opportunity object to be updated based on a more recent sales attempt.
ELECTRONIC NOTE MANAGEMENT VIA A CONNECTED ENTITY GRAPH
A computer-implemented method comprises storing a connected entity graph in which a node corresponds to an entity type of an electronic note, a person, or an event, and an edge connects two nodes; receiving, via a graphical user interface (GUI), a specific entity type and a selection of a specific node; causing displaying in the GUI a second degree view, including the specific node in the center, first nodes connected to the specific node with zero or one intermediary node in the connected entity graph in a first concentric layout, and second nodes connected to the specific node with two intermediary nodes in the connected entity graph in a second concentric layout, the first nodes and second nodes corresponding to a common entity type, the specific node corresponding to a different entity type, and the nodes corresponding to an electronic note and the specific entity type.