Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/10—File systems; File servers
  • G06F16/17—Details of further file system functions
  • G06F16/176—Support for shared access to files; File sharing support
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/10—File systems; File servers
  • G06F16/14—Details of searching files based on file metadata
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/10—File systems; File servers
  • G06F16/14—Details of searching files based on file metadata
  • G06F16/148—File search processing
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/10—File systems; File servers
  • G06F16/17—Details of further file system functions
  • G06F16/174—Redundancy elimination performed by the file system
  • G06F16/1748—De-duplication implemented within the file system, e.g. based on file segments
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
  • G06F16/22—Indexing; Data structures therefor; Storage structures
  • G06F16/2228—Indexing structures
  • G06F16/2272—Management thereof
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
  • G06F16/31—Indexing; Data structures therefor; Storage structures
  • G06F16/316—Indexing structures
  • G06F16/322—Trees
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
  • G06F16/31—Indexing; Data structures therefor; Storage structures
  • G06F16/316—Indexing structures
  • G06F16/325—Hash tables
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
  • G06F16/33—Querying
  • G06F16/3331—Query processing
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/90—Details of database functions independent of the retrieved data types
  • G06F16/93—Document management systems
  • G06F16/94—Hypermedia
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/90—Details of database functions independent of the retrieved data types
  • G06F16/95—Retrieval from the web
  • G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
  • G06F16/9558—Details of hyperlinks; Management of linked annotations
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
  • H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]

Definitions

• This disclosure relates to file sharing.
• Various network-based file sharing services enable users to share files with each other.
• P2P peer-to-peer
• some of such services include Napster, BitTorrent, Dropbox, Box, Egnyte, Google Drive, Microsoft OneDrive, Microsoft SharePoint, Microsoft Teams, Slack, Apple iCIoud, and others.
• these services are popular for use in many situations, there are some situations when these services are inadequate.
• these services are unable to share various files securely and selectively between various predefined user groups based on various predefined workflows. For example, in document onboarding situations, where document permissioning is important for various workflow situations, most users end up searching multitudes of emails and file directories, whether local or cloud-based, for relevant documents, which is laborious, costly, insecure, and time- consuming.
• FIG. 1 shows a schematic diagram of an embodiment of a network topology according to this disclosure.
• FIG. 3 shows a flowchart of an embodiment of a process for granting access to a copied file according to this disclosure.
• FIG. 5 shows a flowchart of an embodiment of a process for receiving access to a file according to this disclosure.
• FIGS. 6A-6C show a flowchart and a pair of screenshots of an embodiment of a technique for tracking a progress against a set of rules based on a file associated with a plurality of item identifiers, a plurality of category identifiers, and a plurality of type identifiers according to this disclosure.
• FIGS. 7A-7C show a flowchart and a pair of screenshots of an embodiment of a technique for updating a progress detail according to this disclosure.
• FIG. 10 shows a flowchart of an embodiment of a process for reading a data structuring via an artificial intelligence (Al) process according to this disclosure.
• FIG. 11 shows a flowchart of an embodiment of a process for a user action with respect to a data structure based on a belonging to a user group according to this disclosure.
• FIGS. 12-22 show a plurality of screenshots of an embodiment of a user interface operating based on a data structure storing a mapping between a document identifier and a plurality of tags according to this disclosure.
• FIGS. 23A-23I show a plurality of screenshots of an embodiment of a multi- user sharing technique according to this disclosure.
• this disclosure enables various computing technologies for sharing various files securely and selectively between various predefined user groups based on various predefined workflows.
• the files are shared based on a data structure storing various document identifiers and various metadata tags, with the document identifiers mapping onto the metadata tags.
• these computing technologies can be used in various situations, such as onboarding or others in many fields, such as finance, accounting, legal, law enforcement, military, intelligence, education, manufacturing, medicine, pre-trade client onboarding, or others.
• FIGS. 1 -231 in which some embodiments of this disclosure are shown.
• a term "or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from context, "X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then "X employs A or B" is satisfied under any of the foregoing instances.
• first, second, and others can be used herein to describe various elements, components, regions, layers, or sections, these elements, components, regions, layers, or sections should not necessarily be limited by such terms. Rather, these terms are used to distinguish one element, component, region, layer, or section from another element, component, region, layer, or section. As such, a first element, component, region, layer, or section discussed below could be termed a second element, component, region, layer, or section without departing from this disclosure.
• FIG. 1 shows a schematic diagram of an embodiment of a network topology according to this disclosure.
• a network topology 100 is implemented in logic, whether hardware-based or software-based, on a component basis.
• logic can comprise circuitry, such as processors, memory, input devices, output devices, or other hardware, that is
• the network topology 100 is based on a distributed network operation model which allocates tasks/workloads between servers, which provide a resource/service, and clients, which request the resource/service.
• the servers and the clients illustrate different computers/applications, but in some embodiments, the servers and the clients reside in or are one system/device/framework/platform/application. Further, in some embodiments, the topology 100 entails allocating a large number of resources to a small number of computers, where complexity of the clients depends on how much computation is offloaded to the small number of computers, i.e. , more computation offloaded from the clients onto the servers leads to lighter clients, such as being more reliant on network sources and less reliant on local computing resources.
• such models can comprise decentralized computing, such as a P2P system, for instance BitTorrent, or distributed computing, such as via a computer cluster where a set of networked computers works together such that the computer can be viewed as a single system.
• the network topology 100 includes a network 102, a client 104, a client 106, a server 110, and a database 146.
• the client 104 hosts an operating system (OS) 112 and a browser 118 running on the OS 112.
• the client 106 hosts an OS 114 and a browser 120 running on the OS 114.
• the server 110 hosts an OS 116 and an
• the application 122 runs on the OS 116.
• the application 122 hosts a blockchain logic 124, an interface logic 126, a messaging logic 128, an export logic 130, a storage logic 132, a reporting logic 134, a metadata logic 136, a progress logic 138, a privilege logic 138, a search logic 140, a permission logic 142, and a notification logic 144, any one of which can be a module, an object, a routine, a script, a library, or others.
• the network 102 includes a plurality of nodes, such as a collection of computers or other hardware interconnected via a plurality of communication channels, which allow for sharing of resources or information. Such interconnection can be direct or indirect.
• the network 102 can be wired or wireless.
• the network 102 can allow for communication over short or long distances, whether encrypted or unencrypted.
• the network 102 can operate via at least one network protocol, such as Ethernet, a
• the network 102 can have any scale, such as a personal area network (PAN), a local area network (LAN), a home area network, a storage area network (SAN), a campus area network, a backbone network, a metropolitan area network, a wide area network (WAN), an enterprise private network, a virtual private network (VPN), a virtual network, a satellite network, a computer cloud network, an internetwork, a cellular network, and so forth.
• PAN personal area network
• LAN local area network
• SAN storage area network
• WAN wide area network
• VPN virtual private network
• satellite network a computer cloud network
• internetwork a cellular network
• the network 102 can be or include an intranet or an extranet.
• the network 102 can be or include Internet.
• the network 102 can include other networks or allow for
• the network 102 can include hardware, such as a computer, a network interface card, a repeater, a hub, a bridge, a switch, an extender, an antenna, or a firewall, whether hardware based or software based.
• the network 102 can be operated, directly or indirectly, by or on behalf of an entity or an actor, irrespective of any relation to any contents of this disclosure.
• the clients 104, 106 can be embodied as a terminal, a kiosk, a workstation, a vehicle, whether land, marine, or aerial, a desktop, a laptop, a tablet, a mobile phone, a mainframe, a supercomputer, a server farm, and so forth.
• the clients 104, 106 can include or be coupled to an input device, such as a mouse, a keyboard, a camera, whether forward-facing or back-facing, an accelerometer, a touchscreen, a biometric reader, a clicker, a microphone, or any other suitable input device.
• the clients 104, 106 can include or be coupled to an output device, such as a display, a speaker, a headphone, a joystick, a printer, or any other suitable output device.
• an input device such as a mouse, a keyboard, a camera, whether forward-facing or back-facing, an accelerometer, a touchscreen, a biometric reader, a clicker, a microphone, or any other suitable input device.
• the clients 104, 106 are in communication with the network 102, such as via the browsers 118, 120, or with the server 110 through the network 110, such as via the browsers 118, 120. In some embodiments, the clients 104, 106 are in communication with the server 110 directly, thereby bypassing the network 102. Note that more than two clients 104, 106 can be used as well, such as tens, hundreds, or thousands of clients or even more, whether identical to or different from each other in hardware or software configuration.
• the input device and the output device can be embodied in one unit, such as a touch-enabled display, which can be haptic.
• the OS 116 can be any type of an OS, such as MacOS, Windows, Android, Unix, Linux, or others.
• the server 110 can be a single server or a plurality of servers, such as the server 110 being distributed among a web server, an application server, a database server, a virtual server, or others.
• the application 112 operates as instructed via the blockchain logic 124, the interface logic 126, the messaging logic 128, the export logic 130, the storage logic 132, the reporting logic 134, the metadata logic 136, the progress logic 138, the privilege logic 138, the search logic 140, the permission logic 142, and the notification logic 144.
• At least one of the blockchain logic 124, the interface logic 126, the messaging logic 128, the export logic 130, the storage logic 132, the reporting logic 134, the metadata logic 136, the progress logic 138, the privilege logic 138, the search logic 140, the permission logic 142, or the notification logic 144 is external to at least one of the application 112, the OS 116, or the server 110.
• at least two of the blockchain logic 124, the interface logic 126, the messaging logic 128, the export logic 130, the storage logic 132, the reporting logic 134, the metadata logic 136, the progress logic 138, the privilege logic 138, the search logic 140, the permission logic 142, and the notification logic 144 can be a single logic.
• the application 112 is modular with respect to the blockchain logic 124, the interface logic 126, the messaging logic 128, the export logic 130, the storage logic 132, the reporting logic 134, the metadata logic 136, the progress logic 138, the privilege logic 138, the search logic 140, the permission logic 142, and the notification logic 144, the application 112 can be non-modular, such as objected oriented, monolithic, or others.
• the database 146 is hosted off the server 110.
• the server 110 hosts the database 146, whether internal to the application 122 or external to the application 122, such as via the OS 116.
• the database 146 is configured for various database operations, such as creating records, modifying records, retrieving records, searching records, identifying records, deleting records, sorting records, or others, in whole or in part.
• database input (I)/ output (0) operations include reading, writing, editing, deleting, updating, searching, selecting, merging, sorting, erasing, formatting, or others.
• the database 146 stores data, whether in a raw state, a formatted state, an organized stated, or any other accessible state, and allows access to such data, whether directly and/or indirectly.
• the network 100 topology is configured to perform a technique for sharing various files securely and selectively between various predefined user groups based on various predefined workflows.
• the files are shared based on a data structure storing various document identifiers and various metadata tags, with the document identifiers mapping onto the metadata tags.
• FIG. 2 shows a schematic diagram of an embodiment of a data organization according to this disclosure.
• the application 122 maintains or operates based on a data organization in accordance with a schema 200.
• the schema 200 includes an entity identifier 202, an action identifier 204, an item identifier 206, a category identifier 208, a type identifier 210, a task identifier 212, and a document identifier 214.
• Each of the entity identifier 202, the action identifier 204, the item identifier 206, the category identifier 208, the type identifier 210, the task identifier 212, and the document identifier 214 includes a set, a sequence, a term, a collection, a group, a string, or other informational unit of alphabetic, numeric, alphanumeric, glyphic, barcode, pictorial symbols or marks or any other informational form in any other organizational
• Each of the entity identifier 202, the action identifier 204, the item identifier 206, the category identifier 208, the type identifier 210, the task identifier 212, and the document identifier 214 can be generated in accordance with a predefined format, such as an International Standards Organization (ISO) format or others, or a combination of formats, such a plurality of ISO formats, or randomly generated.
• a predefined format such as an International Standards Organization (ISO) format or others, or a combination of formats, such a plurality of ISO formats, or randomly generated.
• Each of the entity identifier 202, the action identifier 204, the item identifier 206, the category identifier 208, the type identifier 210, the task identifier 212, and the document identifier 214 can be unique with respect to the application 122, with respect to each other, or with respect to that particular identifier collection or identifier type or identifier format.
• the schema 200 includes a logical format as indicated by a plurality of lines between the entity identifier 202, the action identifier 204, the item identifier 206, the category identifier 208, the type identifier 210, the task identifier 212, and the document identifier 214.
• the entity identifier 202 is hierarchically related to the action identifier 204 such that the entity identifier 202 is in a one-to-many correspondence with the action identifier 204.
• the entity identifier 202 can hierarchically have many action identifiers 204.
• the document identifier 214 can be grouped with many entity identifiers 202, many action identifiers 204, many item identifiers 206, many category identifiers 208, and many type identifiers 210.
• the task identifier 212 is grouped with the document identifier 214 in a one-to-many correspondence.
• the task identifier 212 can be grouped with many document identifiers 214.
• the task identifier 212 corresponds to a task based on which a file will be shared, as further described below.
• the task identifier 212 can be generated based at least one of the entity identifier, the action identifier 204, or the item identifier 206.
• the task identifier 212 can be a string a new fund launch 41 or NFL000041 or others. Therefore, if the entity identifier 202 includes an LEI and the action identifier 204 includes a string NFL, where the entity identifier 202
• the item identifier 206 can include a string FID, where the action identifier 204 corresponds to the item identifier 206 in a one-to-many correspondence
• the category identifier 208 can include a string PID, where the item identifier 206 corresponds to the category identifier 208 in a one-to-many correspondence
• the type identifier 210 can include a string ISDAA, where the category identifier 208 corresponds to the type identifier 210 in a one-to-many correspondence
• the task identifier 212 can be NFL000041 to which each of the entity identifier 202, the action identifier 204, and the item identifier 206 correspond in a many-to-one correspondence.
• the document identifier 214 corresponds to a file that is being shared.
• the document identifier 214 can be generated based on a content of the file, such as a document text or a pattern within the file, or a characteristic of the file, such as a file name, a read or last-accessed or modified or created date or time stamp, a file size, or neither, such as randomly, or others.
• the document identifier 214 can include a string AK24!%asfl_m@$1fa or others.
• the entity identifier 202 includes an LEI and the action identifier 204 includes a string NFL, where the entity identifier 202 corresponds to the action identifier 204 in a one-to-many correspondence, and the item identifier 206 can include a string FID, where the action identifier 204 corresponds to the item identifier 206 in a one-to-many correspondence, and the category identifier 208 can include a string PID, where the item identifier 206 corresponds to the category identifier 208 in a one-to- many correspondence, and the type identifier 210 can include a string ISDAA, where the category identifier 208 corresponds to the type identifier 210 in a one-to-many correspondence, and the task identifier 212 can be NFL000041 to which each of the entity identifier 202, the action identifier 204, and the item identifier 206 correspond in a many-to-one correspondence, and the category identifier
• many document identifiers 214 to the entity identifier 202 can correspond to the action identifier 204, many document identifiers 214 can correspond to the item identifier 206, many document identifiers 214 can correspond to the category identifier 208, many document identifiers 214 can
• FIG. 3 shows a flowchart of an embodiment of a process for granting access to a copied file according to this disclosure.
• a process 300 is performed via the network topology 100.
• the interface logic 126 presents a graphical user interface (GUI) to the browser 118 over the network 102.
• GUI graphical user interface
• the GUI depicts a set of input elements, such as a text field, a dropdown box, a radio button, a slider, or others.
• the GUI can include a menu, a form, or questionnaire presented on at least one page, such as a webpage or others.
• the set of input elements are ready for user data entry, such as via an input device, such as a mouse, a keyboard, whether physical or virtual, a touchpad, a trackball, a camera, a microphone, or others.
• the interface logic 126 presents the GUI based on the client 104 sending the server 110 a name and a password for
• each of the name and the password can include an alphanumeric string, a photo, a biometric, or others.
• the server 110 can host a session with the client 104 based on the application 122 communicating with the browser 118.
• the session can be a secure session, such as via an hypertext transfer protocol secure (FITTPS) protocol or others.
• FITTPS hypertext transfer protocol secure
• the interface logic 126 receives a first entity identifier, an action identifier, an item identifier, a category identifier, a type identifier, and a copied file from the browser 118.
• the first entity identifier corresponds to the entity identifier 202
• the action identifier corresponds to the action identifier 204
• the item identifier corresponds to the item identifier 206
• the category identifier corresponds to the category identifier 208
• the type identifier corresponds to the type identifier 210.
• the first entity identifier can correspond to the action identifier in a one-to-many correspondence.
• the session between the browser 118 and the application 122 can be associated with the first entity identifier and others, such as the action identifier, the item identifier, the category identifier, or others.
• the browser 118 can login into the server 110 based on a set of user credentials belonging to or corresponding to a user group associated with the first entity identifier, such as a first user who can grant a permission for a file to a second user, where the first user is operating the browser 118, where the second user is associated with the first entity identifier or another entity identifier, where the permission can include a read permission, a write permission, or others.
• the session between the browser 118 and the application 122 can be non-associated with the first user identifier.
• the browser 118 can login into the server 110 based on a set of user credentials belonging to or corresponding to a user group non-associated with the first entity identifier where a user of the browser 118 acts as a 3rd party or matchmaker between a plurality of entity identifiers inclusive of the first entity identifier. For example, in context of finance, this situation can occur between a broker (the first entity identifier) setting up an account between a client of the broker and a settlement bank of the broker.
• the copied file is received from the client 104, such as whether the file was stored on the client 104 prior to copying or otherwise accessible to the client 104 or the browser 118, or from a data source remote from the client 104, such as via a network- based file sharing service, whether P2P or cloud-based, such as Napster, BitTorrent, Dropbox, Box, Egnyte, Google Drive, Microsoft OneDrive, Microsoft Sharepoint,
• P2P or cloud-based such as Napster, BitTorrent, Dropbox, Box, Egnyte, Google Drive, Microsoft OneDrive, Microsoft Sharepoint
• the copied file can be a data file, such as a productivity document file, such as a Microsoft Word file, a Microsoft Excel file, a Portable Document Format (PDF) file, an image file, a sound file, a plaintext file, a settings file, or others, whether password protected or not password protected.
• a productivity document file such as a Microsoft Word file, a Microsoft Excel file, a Portable Document Format (PDF) file
• PDF Portable Document Format
• the copied file can be an executable file, such as a. BAT file, a. COM file, a. EXE file, a .BIN file, a smart contract file, or others, whether
• the copied file can be stored local to or remote from the server 110.
• the copied file can be stored via the database 146, as managed via the storage logic 132.
• the server 110 can check the copied file for viruses or other malware when receiving the copied file. If the server 110 detects the copied file to contain the virus, then the server 110 can inform the client 104 of such and delete the copied file from the server 110.
• the metadata logic 136 generates a task identifier to be
• the task identifier corresponds to the task identifier 212.
• the task identifier can be generated based on the action identifier.
• the task identifier is associated with the first entity identifier, the action identifier, the item identifier, and the category identifier based on grouping the task identifier with the first entity identifier in a one-to-many correspondence, the action identifier in a one-to-many correspondence, the item identifier in a one-to-many correspondence, and the category identifier in a one-to-many correspondence.
• the metadata logic 136 populates a data structure such that the document identifier is mapped onto the first entity identifier, the action identifier, the item identifier, the category identifier, and the type identifier. Note that the data structure can be preexisting at that time or created at that time for use via the metadata logic 136.
• the data structure stores the document identifier mapped to each of the first entity identifier in a one-to-many correspondence, each of the action identifier in a one-to- many correspondence, each of the item identifier in a one-to-many correspondence, each of the category identifier in a one-to-many correspondence, and each of the type identifier in a one-to-many correspondence.
• the data structure can be populated with the task identifier such that the document identifier is mapped onto the task identifier or such that the task identifier is mapped onto the document identifier.
• the interface logic 126 enables the GUI presented via the browser 118 to input a second entity identifier.
• the second entity identifier corresponds to the entity identifier 202.
• the second entity identifier can be identical to or different from the first identifier.
• the second entity identifier can be identical to the first entity identifier, such as when sharing within a common user group, or different from the first entity identifier, such as when sharing between different user groups.
• the second entity identifier can be
• the browser 118 can be associated with the first entity identifier (file sender) or a third entity identifier (matchmaker between two entity identifiers). Also, note that at least one of the first entity identifier or the second entity identifier can include a legal entity identifier, whether those identifiers are identical to or different from each other in content, format, or others. Note that the task identifier can be generated based on at least one of the first entity identifier or the second entity identifier.
• the metadata logic 136 associates the task identifier with the second entity identifier. For example, such association can occur via grouping the second entity identifier with the task identifier. Likewise, for example, such association can occur via forming a hash table mapping the task identifier to the second entity identifier. Similarly, for example, such association can occur via writing the second entity identifier into the data structure such that the document identifier is mapped onto the second entity identifier and the task identifier is mapped onto the document identifier. Note that the second entity identifier can correspond to the action identifier in a one-to- many correspondence.
• the permission logic 142 can share the copied file based on the document identifier. For example, the permission logic 142 can share the copied file via sending a message with a hyperlink from the user associated with the first entity identifier to the user associated with the second entity identifier such that the user associated with the second entity identifier can access the copied file via activating the hyperlink.
• the message can be sent and received via the messaging logic 128 and be notified of via the notification logic 144.
• the server 110 can access the task identifier corresponding to the first entity identifier and the second entity identifier (and other identifiers disclosed herein), identify the document identifier corresponding to the task identifier, retrieve the copied file from a repository based on the document identifier, and avail the copied file with the user associated with the second entity identifier.
• the copied file can be shared with the browser 120 during the session via a presentation of a hyperlink on the browser 120, where the copied file is at least one of opened or downloaded based on an activation of the hyperlink via the browser 120 during the session.
• the message can include an email message, a text message, an over-the-top (OTT) message, a social networking message, or others.
• the access can be a read right, a write right, or others.
• the browser 118 can be associated with the task identifier during the session, such as via a cookie stored on the client 106 or others, based on the user associated with the second entity identifier providing an input into the browser 118, where the input can include the entity identifier, the action identifier, the item identifier, the category identifier, or others, as explained above.
• the permission logic 142 can share the copied file via an icon corresponding to the copied file appearing within the GUI presented on the browser 120 of the client 106, where the browser 120 is associated with the user corresponding to the second entity identifier and where the copied file can be accessed via activating the icon, such as via clicking, touching, or others.
• the browser 120 can be associated with the task identifier during the session based on the item identifier being associated with the session and the category identifier being associated with the session matching the item identifier in the data structure and the category identifier in the data structure. Consequently, the server 110 shares the copied file with the browser 120 during the session based on the task identifier such that the copied file is retrievable via the browser 120 based on the document identifier stored in the data structure.
• the copied file can be shared with more than two entity identifiers, such as at least three or more. For example, in context of finance, this can involve an asset manager, a fund administrator, and a custodian, as explained above.
• the server 110 can deduplicate the copied file before sharing the copied file with the browser 120 during the session, as explained above.
• the copied file can be deduplicated based on at least one of the first entity identifier, the second entity identifier, the action identifier, or the task identifier.
• the copied file can be deduplicated based on at least the first entity identifier, the action identifier, and at least one of the task identifier or the second entity identifier.
• the copied file can be deduplicated based on the first entity identifier, the action identifier, the task identifier, the second entity identifier, and at least one of the item identifier or the category identifier.
• the server 110 includes a web server, an application server, and a database server.
• the web server serves the GUI on the browser 118 and receives the first entity identifier, the second entity identifier, the action identifier, and the copy.
• the application server generates the task identifier, the data structure, and the document identifier.
• the application server groups the data structure with the task identifier.
• the application server populates the data structure with the document identifier, the first entity identifier, the second entity identifier, and the action identifier such that the document identifier maps onto the first entity identifier, the second entity identifier, and the action identifier.
• the web server hosts the session with the browser 120 and the application server associates the browser 120 with the task identifier during the session based on the second entity identifier associated with the session and the action identifier associated with the session matching the second entity identifier in the data structure and the action identifier in the data structure.
• the application server shares the copy with the browser 120 via the database server.
• the database server stores the copy.
• FIG. 4 shows a schematic diagram of an embodiment of a data structure storing a document identifier and a plurality of tags according to this disclosure.
• a data structure 400 is presented as a table having a plurality of rows 402, 404, 406 and a plurality of columns 408, 410, 412, 414, 416 thereby defining a grid with a plurality of addressable cells (fifteen as shown although more or less is possible).
• Each of the addressable cells stores a metadata tag corresponding to an identifier disclosed herein.
• the row 402 stores a document identifier 398lak@!$sdjlaks, a tag 1 (a first entity identifier), a tag 2 (a second entity identifier), a tag 3 (an action identifier).
• the row 402 includes an empty cell, which can be populated with a tag 4.
• the row 404 includes a document identifier 43!5%#alksn, a tag 1 (a first entity identifier), a tag 2 (a second entity identifier), a tag 3 (an action identifier), a tag 4 (an item identifier).
• the row 402 and the row 404 are different in an amount of populated cells, although the row 402 and the row 404 may not differ in the amount of populated cells.
• the data structure 400 can be static or dynamic with respect to at least one of a shape thereof or a size thereof.
• the rows 402, 404, 406 or the columns 408, 410, 412, 414, 416 can be static or dynamic in number.
• the data structure 400 can store a set of tags in at least one of a predefined order or a predefined cell arrangement.
• the predefined order can mandate that entity identifiers (tag 1 and tag 2) sequentially precede action identifiers (tag 3) and action identifiers (tag 3) sequentially precede item identifiers (tag 4) or others.
• the predefined cell arrangement can mandate that entity identifiers (tag 1 and tag 2) are populated in specified addressable cells (column 410 and column 412) and action identifiers are populated in specified addressable cells (column 414).
• the data structure 400 does not store a set of tags in at least one of a predefined order or a predefined cell arrangement.
• FIG. 5 shows a flowchart of an embodiment of a process for receiving access to a file according to this disclosure.
• a process 500 is performed via the network topology 100.
• the interface logic 126 presents a GUI to a browser, as explained above.
• the interface logic 126 receives a plurality of identifiers via the GUI, as explained above.
• the identifiers can include a first entity identifier, a second entity identifier, an action identifier, an item identifier, a category identifier, a type identifier, or others, as explained above.
• the permission logic 142 accesses a data structure, as explained above.
• the data structure stores a document identifier, a metadata tag, and a mapping between the document identifier and the metadata tag, as explained above.
• the document identifier can be mapped to the metadata tag in a one-to-many correspondence, as explained above.
• the metadata tag includes information
• the search logic 140 searches the data structure for a match between the tag and at least one of the identifiers, as input. For example, when the data structure stores a plurality of metadata tags and when the browser receives a first entity identifier, a second entity identifier, an action identifier, an item identifier, a category identifier, and a type identifier the search logic 140 searches the data structure for the match between those identifiers and the tag.
• the search logic 140 can employ at least one of a brute force search algorithm, a linear search algorithm, a binary search algorithm, a tree search algorithm, a stochastic search algorithm a depth search algorithm, a breadth search algorithm, or others.
• the search logic 140 can search for the match in parallel (concurrently search for matches between the identifiers and the tags) or in series (sequentially search for matches between the identifiers and the tags).
• the search logic 140 identifies the match between the tag and at least one of the identifiers.
• the match can be identified between the tag and at least one of the first entity identifier, the second entity identifier, the action identifier, the task identifier, the item identifier, or the category identifier.
• the permission logic 142 accesses a set of rules associated with the tag, as matched to at least one of the identifiers.
• the set of rules corresponds to a predefined workflow associated with that tag and to the task identifier corresponding to that tag.
• the set of rules can control how the GUI is presented to a user operating the browser. For example, the set of rules can control what output elements are presented and content/logic therein or therebetween or what input elements are presented and content/logic therein or therebetween.
• the permission logic 142 can identify the set of rules corresponding to the task identifier.
• the interface logic 126 communicates with the permission logic 142 such that the file is availed via the GUI based on the set of rules, as explained above.
• the permission logic 142 can share the file via presenting a message with a hyperlink such that the file can be accessed via activating the hyperlink or via an icon corresponding to the file appearing within the GUI and where the file can be accessed via activating the icon, such as via clicking, touching, or others.
• FIGS. 6A-6C show a flowchart and a pair of screenshots of an embodiment of a technique for tracking a progress against a set of rules based on a file associated with a plurality of item identifiers, a plurality of category identifiers, and a plurality of type identifiers according to this disclosure.
• a process 600A is performed via the network topology 100.
• the interface logic 126 populates the GUI 600B, 600C with a plurality of strings based on the entity identifier, the action identifier, the item identifiers, and the category identifiers.
• the strings correspond to the entity identifier, the action identifier, the item identifier, and the category identifier.
• the strings can be labels, whether passive or active (hyperlinked), to aid in user interactivity.
• the checkbox based grid 616 includes a pause button and a play button for each of the item identifiers, with the pause button pausing a progress analysis against that respective item identifier and the play button maintaining a progress analysis active against that respective item identifier.
• the checkbox based grid 616 gets completed, as determined against the set of rules.
• the checkbox based grid 616 can be manually updated via the browser 118 or the browser 120 in real-time so that the checkbox based grid 616 is visually updated to at least one of the browser 118 or the browser 120.
• the interface logic 126 communicates with the metadata logic 136 and the progress logic 138 such that the GUI 600B updates the tabular menu 610 with respect to the item identifiers based on the category identifiers and the type identifiers. For example, as the files get uploaded via the GUI 600C, the checkbox based grid 616 gets updated based on the set of rules corresponding to the task identifier. Therefore, the pie bar 620 is updated accordingly.
• FIGS. 7A-7C show a flowchart and a pair of screenshots of an embodiment of a technique for updating a progress detail according to this disclosure.
• a process 700A is performed via the network topology 100.
• FIG. 8 shows a flowchart of an embodiment of a process for appending to a blockchain according to this disclosure.
• a process 800 is performed via the network topology 100.
• the metadata logic 136 communicates with the interface logic 126 such that the metadata logic 136 receives a plurality of identifiers and a copied file from a browser of a client, as explained above.
• the identifiers can include an entity identifier, an action identifier, a plurality of item identifiers, a plurality of category identifiers, or others.
• the metadata logic 136 generates a document identifier for the copied file, as explained above.
• the metadata logic 136 writes the identifiers into a data structure, as explained above.
• the blockchain logic 124 reads the block in the blockchain.
• the blockchain logic 124 can communicate with any logic local to or remote from the server 110 to take an action, whether the logic is hardware-based or software-based.
• the action can include reading data, writing data, selecting data, deleting data, formatting data, sending or receiving a message to a client or a data source, whether local or remote from the server 110, communicating with an input device or an output device, whether local or remote from the server 110, or others.
• FIG. 9 shows a flowchart of an embodiment of a process for executing a smart contract based on a data structuring according to this disclosure.
• a process 900 is performed via the network topology 100.
• the blockchain logic 124 accesses a smart contract logic, whether local to or remote from the server 110.
• the smart contract logic can include an Ethereum platform logic.
• the smart contract logic can include various executable code, such as functions, objects, or others, stored in a data structure, such as a file or others, whether including any identifiers, as explained above, or excluding any identifiers, as explained above.
• the application 122 employs an artificial intelligence process to read the data structure such that the application 122 determines a population pattern, a storage pattern, an organizational pattern, a date/timing pattern, a sequence pattern, a tag pattern, a task pattern, an action patter, an item pattern, a category pattern, a product pattern, a type pattern, an identifier pattern, or any other pattern or classification or lack of any thereof within the data structure based on a content of the data structure.
• the artificial intelligence process can employ machine learning, image processing, text analysis, querying of a remote data source, or others, whether local to or remote from the server 110, inclusive of any cloud-based or distributed environments.
• the application 122 takes an action or cause another logic entity to take an action, whether the entity is hardware or software based.
• the action can include reading data, writing data, selecting data, deleting data,
• FIG. 11 shows a flowchart of an embodiment of a process for a user action with respect to a data structure based on a belonging to a user group according to this disclosure.
• a process 1100 is performed via the network topology 100.
• the privilege logic 138 interfaces with the metadata logic 136 to identify a user group to which the user belongs based on the user identifier.
• the user group corresponds to the task identifier, as explained above. For example, this identification can occur via identifying the task identifier associated with the entity identifier to which the user identifier is related or vice versa. For example, this can occur via the task identifier being associated with the entity identifier and, since the entity identifier can have a plurality of user identifiers associated therewith, the user identifier can be looked up against the user identifiers associated with the entity identifier for that task identifier. Note that the user identifier can be associated with a plurality of task identifiers simultaneously. As such, the user group to which the user belongs can be identified.
• the permission logic 142 interfaces with the metadata logic 136 to enable the user to act with respect to a data structure storing a document identifier, a tag, and a mapping between the document identifier and the tag based on the group, as explained above.
• the user can access a file based on the document identifier associated with the task identifier for the user group to which the user belongs and then access the file based on the document identifier, as explained above.
• FIGS. 12-22 show a plurality of screenshots of an embodiment of a user interface operating based on a data structure storing a mapping between a document identifier and a plurality of tags according to this disclosure.
• FIG. 12 shows a GUI 1200 which, as explained above, tabularly displays a grid containing a task identifier column listing a plurality of task identifiers
• first entity identifier column listing a plurality of first entity identifiers for the task identifiers
• second entity identifier column listing a plurality of second entity identifiers for the task identifiers
• an action required identifier column listing a plurality of action identifiers (binarily-presented stars) based on a type identifier and a set of rules for the task identifiers
• an age identifier column listing a plurality of age identifiers based on a set of rules for the task identifiers (as tracked via data structures).
• FIG. 13 shows a GUI 1300, which as explained above, presents the checkbox based grid 616, as explained above.
• the category identifiers (USD Repos and Non-USD Repos) are complete, as indicated by checked checkboxes that are also made visually distinct. In contrast, other category identifiers are not checked to be completed. Also, note that some category identifiers (equity swaps) are paused, as indicated by a visually distinct icon.
• FIG. 14 shows a GUI 1400, which as explained above, via the export logic 130, enables a user to export a data structure with a document identifier, a tag, and a mapping between the document identifier and the mapping to another server.
• the data structure storing the document identifier, the first entity identifier, the second entity identifier, and the action identifier is exportable as a data file, such as a comma-separated-value file, a flat file, or others.
• FIG. 15 shows a GUI 1500, which as explained above, via the progress logic 138, enables tracking of a plurality of workflows associated with a plurality of entity identifiers based on a plurality of task identifiers.
• the workflows corresponds to a plurality of histograms corresponding to the entity identifiers and track which documents are past due or coming due or OK, as measured against a set of rules, whether for a particular task identifier or entity identifier, as explained above.
• the set of rules can include a target document upload date which can be input via the browser 118 or the browser 120, as explained above.
• FIG. 16 shows a GUI 1600, which as explained above, via the progress logic 138 enables a more granular document tracking with respect to the GUI 1500.
• this type of tracking can be based on entity identifiers for specific time periods, as measured against a set of rules, whether for a particular task identifier or entity identifier, as explained above.
• FIG. 17 shows a GUI 1700, which as explained above, via the progress logic 138, enables even more granular document tracking with respect to the GUI 1600.
• the GUI 1700 depicts average task completion time for a particular identifier with respect to various workflows, as measured against a set of rules, whether for a
• FIG. 20 shows a GUI 2000, which as explained above, shows a tabular view of a plurality of hyperlinked item identifiers and a plurality of category identifiers
• FIGS. 23A-23I show a plurality of screenshots of an embodiment of a multi- user sharing technique according to this disclosure.
• a GUI 2300 shows a multi-page questionnaire involving a workflow with a plurality of users associated with different entity identifiers.
• a set of rules is formed against which the workflow is evaluated based on files, as uploaded, and compared via a data structure, as explained above.
• the GUI presents various tabular menus, which enable document tracking, progress monitoring, and inter-user messaging based on various identifiers, as explained above.
• I/O devices can be coupled to the system either directly or through intervening I/O controllers.
• Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modems, and Ethernet cards are just a few of the available types of network adapters.
• computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
• the computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
• the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
• LAN local area network
• WAN wide area network
• Internet Service Provider for example, AT&T, MCI, Sprint, EarthLink, MSN, GTE, etc.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Databases & Information Systems (AREA)
• Data Mining & Analysis (AREA)
• General Physics & Mathematics (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• Software Systems (AREA)
• Library & Information Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Business, Economics & Management (AREA)
• General Business, Economics & Management (AREA)
• Computational Linguistics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Information Transfer Between Computers (AREA)

Priority Applications (13)

Applications Claiming Priority (4)

Publications (1)

Family

ID=68466129

Family Applications (1)

Country Status (10)

Cited By (1)

Families Citing this family (21)

Citations (4)

Family Cites Families (123)

• 2018
  • 2018-06-08 US US16/501,110 patent/US10846268B2/en active Active
  • 2018-12-05 US US16/211,100 patent/US10474640B1/en active Active
• 2019
  • 2019-06-07 CA CA3102961A patent/CA3102961C/en active Active
  • 2019-06-07 JP JP2020568408A patent/JP7116197B2/ja active Active
  • 2019-06-07 KR KR1020217025696A patent/KR20210104928A/ko not_active Application Discontinuation
  • 2019-06-07 KR KR1020217000556A patent/KR102291842B1/ko active IP Right Grant
  • 2019-06-07 SG SG11202012181PA patent/SG11202012181PA/en unknown
  • 2019-06-07 IL IL279228A patent/IL279228B1/en unknown
  • 2019-06-07 CN CN201980044729.XA patent/CN112368691A/zh active Pending
  • 2019-06-07 EP EP19815057.5A patent/EP3814925A4/en active Pending
  • 2019-06-07 WO PCT/US2019/036033 patent/WO2019236986A1/en unknown
  • 2019-06-07 KR KR1020247022496A patent/KR20240110669A/ko active Search and Examination
  • 2019-06-07 AU AU2019280994A patent/AU2019280994B2/en active Active
• 2020
  • 2020-11-20 US US16/953,830 patent/US11422979B2/en active Active
• 2021
  • 2021-07-01 AU AU2021204627A patent/AU2021204627B2/en active Active
• 2022
  • 2022-07-28 JP JP2022120406A patent/JP7417677B2/ja active Active
  • 2022-08-17 US US17/890,191 patent/US11841831B2/en active Active
• 2023
  • 2023-12-08 US US18/533,432 patent/US20240168925A1/en active Pending
• 2024
  • 2024-01-05 JP JP2024000727A patent/JP2024038272A/ja active Pending

Patent Citations (4)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events