Abstract: A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

Abstract: A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

Abstract: A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

Abstract: A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

Abstract: Techniques are described herein for performing a dictionary-based dependency determination. For example, when a package is selected to be imported from a store (e.g., a database), a dictionary-based dependency operation may be performed to determine which elements of the package are dependent on other elements of the package. A dictionary includes indexes, each of which has at least one value. The indexes correspond to respective resources, and each value indicates an element of the package that produces the resource that corresponds to the respective index. If an element of the package consumes a resource, the indexes and corresponding values in the dictionary may be reviewed to determine which element(s) of the package produce that resource.

Abstract: Techniques are described herein for performing a dictionary-based dependency determination. For example, when a package is selected to be imported from a store (e.g., a database), a dictionary-based dependency operation may be performed to determine which elements of the package are dependent on other elements of the package. A dictionary includes indexes, each of which has at least one value. The indexes correspond to respective resources, and each value indicates an element of the package that produces the resource that corresponds to the respective index. If an element of the package consumes a resource, the indexes and corresponding values in the dictionary may be reviewed to determine which element(s) of the package produce that resource.

Abstract: Techniques are described herein for performing a dictionary-based dependency determination. For example, when a package is selected to be imported from a store (e.g., a database), a dictionary-based dependency operation may be performed to determine which elements of the package are dependent on other elements of the package. A dictionary includes indexes, each of which has at least one value. The indexes correspond to respective resources, and each value indicates an element of the package that produces the resource that corresponds to the respective index. If an element of the package consumes a resource, the indexes and corresponding values in the dictionary may be reviewed to determine which element(s) of the package produce that resource.

Abstract: A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

Abstract: Systems and methods for recommending entities to a user are presented. In at least one embodiment, a user is identified as belonging to one or more groups of users, or to a hierarchy of groups. A category of entities, preferred by at least of the hierarchy of identified groups, is identified. The category of entities preferred by the at least one identified group corresponds to the category of a user-preferred entity preferred by the user. An entity from the category of entities is selected; the selected entity is not the user-preferred entity. The selected entity is provided to the user as a recommended entity to the user.

Abstract: Techniques are described herein for performing a dictionary-based dependency determination. For example, when a package is selected to be imported from a store (e.g., a database), a dictionary-based dependency operation may be performed to determine which elements of the package are dependent on other elements of the package. A dictionary includes indexes, each of which has at least one value. The indexes correspond to respective resources, and each value indicates an element of the package that produces the resource that corresponds to the respective index. If an element of the package consumes a resource, the indexes and corresponding values in the dictionary may be reviewed to determine which element(s) of the package produce that resource.