General-purporse key lookup tool(s) for buried primary keys

[CBroz1]

Navigating restrictions described in #630 requires burying primary keys in table definitions like...

@schema
class SpikeSortingRecordingSelection(SpyglassMixin, dj.Manual):
    definition = """
    # Raw voltage traces and parameters. Use `insert_selection` method to insert rows.
    recording_id: uuid
    ---
    -> Raw
    -> SortGroup
    -> IntervalList
    -> SpikeSortingPreprocessingParameters
    -> LabTeam
    """

A unique pairing of each secondary key is associated with a uuid so we don't have issues declaring downstream tables.

As a workaround, we've needed helper functions to be able to trace keys up or down through bury tables, as in #910

@schema
class CurationV1(SpyglassMixin, dj.Manual):
    ...
   @classmethod
    def get_sort_group_info(cls, key: dict) -> dj.Table:
        """Returns the sort group information for the curation
        (e.g. brain region, electrode placement, etc.)
        Parameters
        ----------
        key : dict
            restriction on CuratedSpikeSorting table
        Returns
        -------
        sort_group_info : Table
            Table with information about the sort groups
        """
        table = (
            (cls & key) * SpikeSortingSelection()
        ) * SpikeSortingRecordingSelection().proj(
            "recording_id", "sort_group_id"
        )

        electrode_restrict_list = []
        for x in table:
            # pull just one electrode from each sort group for info
            electrode_restrict_list.extend(
                ((SortGroup.SortGroupElectrode() & x) * Electrode).fetch(
                    limit=1
                )
            )

        sort_group_info = (
            (Electrode & electrode_restrict_list)
            * table
            * SortGroup.SortGroupElectrode()
        ) * BrainRegion()
        return (cls & key).proj() * sort_group_info

Does this need to be handled on a case-by-case basis? Could it be generalized?

[samuelbray32]

I think I have something close to a general solution. It seems able to replicate some of the methods I have in #910.
I'll put together a PR with it. Once I do, @CBroz1 could you help me with detecting alias projections between a parent and a child?

[CBroz1]

Alias mapping is done in the graph, which each table has a copy of.

• DJ source code
• chains implementation
• RestrGraph grabs the graph node data here as just the attr_map field in any graph node's data, and then uses it as a dict in a proj call here

[samuelbray32]

addressed in #949