hierarchyid

问题 I have a table that contains a set of values and a hierarchyid column. Looks something like this: +-----+-------------+-----------+ | ID | HierarchyID | Name | HierarchyID.ToString() for clarity +-----+-------------+-----------+ | 1 | 0x58 | Testing | /1/ | 2 | 0x5AC0 | TChild1 | /1/1 | 3 | 0x5AD6 | TChild1.1 | /1/1/1 | 4 | 0x5ADA | TChild1.2 | /1/1/2/ | 5 | 0x68 | Example | /2/ | 6 | 0x6AC0 | EChild1 | /2/1 | ... | ... | ... | +-----+-------------+-----------+ However, we are introducing a

问题 I have a table that contains a set of values and a hierarchyid column. Looks something like this: +-----+-------------+-----------+ | ID | HierarchyID | Name | HierarchyID.ToString() for clarity +-----+-------------+-----------+ | 1 | 0x58 | Testing | /1/ | 2 | 0x5AC0 | TChild1 | /1/1 | 3 | 0x5AD6 | TChild1.1 | /1/1/1 | 4 | 0x5ADA | TChild1.2 | /1/1/2/ | 5 | 0x68 | Example | /2/ | 6 | 0x6AC0 | EChild1 | /2/1 | ... | ... | ... | +-----+-------------+-----------+ However, we are introducing a

问题 I am working on a multi-level marketing (binary) which looks like this: (but the binary tree is not required to be perfect. A node can have 0-2 child) My problem is the data that I fetch from the database is flat list. Notice that I am using hierarchyid (sql server 2014) Basically the TextNode column is like a breadcrumb. every slash / represents a level . If I have TextNode of /1/ as root. then every node that starts with /1/ belongs to that root which are /1/ , /1/1/ and /1/1/1/ (the root

问题 I am working on a multi-level marketing (binary) which looks like this: (but the binary tree is not required to be perfect. A node can have 0-2 child) My problem is the data that I fetch from the database is flat list. Notice that I am using hierarchyid (sql server 2014) Basically the TextNode column is like a breadcrumb. every slash / represents a level . If I have TextNode of /1/ as root. then every node that starts with /1/ belongs to that root which are /1/ , /1/1/ and /1/1/1/ (the root

问题 For some reason such as performance, I have to use HiarachyId in my database. I have to convert the HierarchyId data type to JSON to show up in FancyTree. I Use the solution here but won't work. My code was static void Main(string[] args) { { var dd = new List<Field>(); dd.Add(new Field(1, "Earth", HierarchyId.Parse("/"))); dd.Add(new Field(2, "Europe", HierarchyId.Parse("/1/"))); dd.Add(new Field(3, "South America", HierarchyId.Parse("/2/"))); dd.Add(new Field(4, "Antarctica", HierarchyId

问题 I am using the HierarchyId data type for the storage of locations. A user may be limited by location ( LocationId ). If the user has more than 1 location limit the IsDescendantOf method on the HierarchyId data type has to be invoked again with an OR . Example(filter Employees by LocationId 5 and 6): SELECT * FROM Employee INNER JOIN Location ON Employee.LocationId = Location.LocationId WHERE Location.Node.IsDescendantOf((SELECT TOP 1 Node FROM Location WHERE LocationId = 5)) = 1 OR Location

问题 Is it possible to sort sql data in a hierarchy by it's hierarchy id, and then for each level sort it say alphabetically? So say we have an Employees Table that lists the organizational hierarchy based on the Employees ID You have Bob (5) who has Phil (17) and Charlie(28) Reporting to him, and Josie (6) has Tyler (15) and Mike (56) Reporting to her. If you sort it by HierarchyID it will look like: Bob (/5/) --Phil (/5/17/) --Charlie (/5/28/) Josie (/6/) --Tyler (/6/15/) --Mike (/6/56/) But It

问题 When you ask for a new HierarchyID between two others, the result gets progressively longer. For example, between 2/5.6 and 2/5.7 there's only 2/5.6.1 and other 4 component paths. The HierarchyID data type is limited to 800 some bytes, so you can't repeat this forever. Then again, integer types are also limited, but it isn't a problem in practice. Should I periodically defragment my table so that height doesn't grow unbounded? 回答1: It's considered a "best practice" with the hierarchyid to

问题 I try to build a menu using the datatype hierarchyid . I have the root node and the current selected node. now I want to list of all elements that are related wetween root and selected node AND there siblings. I get all related elements with following sql query DECLARE @rootNode hierarchyid, @selectedNode hierarchyid SELECT @rootNode = MenuNode FROM CMS_Menu WHERE MenuItemID = 3; SELECT @selectedNode = MenuNode FROM CMS_Menu WHERE MenuItemID =15; SELECT CMS_Menu.MenuNode FROM CMS_Menu WHERE

问题 I have a parent-child hierarchy in my source structure where a child could point to his parent and for his parent could exist multiple rows. If we than flatten the hierarchy this would mean that every child row need to exist beneath his parent row. Image below to clarify I have already picked out my brains how to resolve this in a performant manner in T-SQL because my source set is 300K rows and this will lead to heavy processing. Help is greatly appreciated! Code to directly start from the