bzr bug or corrupted 5.7 tree?

wrong ... question is whether this is a corrupted tree or actually a bzr bug ... -- Hartmut Holzgraefe, Principal Support Engineer (EMEA) SkySQL - The MariaDB Company | http://www.skysql.com/ -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe:http

Re: using a subquery/self-join to recursively retrieve a tree

as you say you need recursion to build the tree from the table. if you are interested just in all the employees that are not manager with their manager info. select * from emp e1 inner join emp e2 on e1.uidman=e2.uid; cheers Claudio 2009/3/10 Ali, Saqib docbook@gmail.com Hello, I

using a subquery/self-join to recursively retrieve a tree

up to a manager, regardless of how deep the tree is. I can do this usindg LDAP and/or PHP, but not sure how to do it as a mysql query. Any thoughts? Thanks saqib http://www.capital-punishment.us -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe:http

Re: using a subquery/self-join to recursively retrieve a tree

How can I do some recursion to get the UIDs of all the employees reporting up to a manager, regardless of how deep the tree is. I can do this usindg LDAP and/or PHP, but not sure how to do it as a mysql query. Examples discussion at http://www.artfulsoftware.com/mysqlbook/sampler/mysqled1ch20

Re: how to obtain development source tree behind a firewall

[EMAIL PROTECTED] wrote: Seems like no way to get directly from development tree behind a firewall. :-) On 12/19/07, Chris [EMAIL PROTECTED] wrote: Xuekun Hu wrote: Hi, guys I am behind a firewall, and have to use http proxy. However seems like the free bitkeeper client (http

how to obtain development source tree behind a firewall

Hi, guys I am behind a firewall, and have to use http proxy. However seems like the free bitkeeper client (http://www.bitmover.com/bk-client2.0.shar) doesn't support HTTP proxy. export http_proxy=http://xxx:xx/ ./bkf clone http://mysql.bkbits.net/mysql-5.1 mysql-5.1 Bad URL does anyone have a

Re: how to obtain development source tree behind a firewall

Xuekun Hu wrote: Hi, guys I am behind a firewall, and have to use http proxy. However seems like the free bitkeeper client (http://www.bitmover.com/bk-client2.0.shar) doesn't support HTTP proxy. export http_proxy=http://xxx:xx/ ./bkf clone http://mysql.bkbits.net/mysql-5.1 mysql-5.1 Bad URL

Re: how to obtain development source tree behind a firewall

Seems like no way to get directly from development tree behind a firewall. :-) On 12/19/07, Chris [EMAIL PROTECTED] wrote: Xuekun Hu wrote: Hi, guys I am behind a firewall, and have to use http proxy. However seems like the free bitkeeper client (http://www.bitmover.com/bk-client2.0

design: save a decision-tree in a db

Hello MySQL Fans First of all, this is not about decision-trees and datamining. And it is not even MySQL-specific. I would like to use a decision-tree to save our business-rules. Rules are existing and extended frequently. Due to the complexness a hierarchical tree would fit in. (e.g. The Nested

Re: tree query

| NO | | 0 | | | unit | char(10)| NO | | EA | | +--+-+--+-+-+---+ This table forms an assembly tree and parts list resource. qty_assy is the qty of each part (part_id) that belongs to an assembly (assy

tree query

| | +--+-+--+-+-+---+ This table forms an assembly tree and parts list resource. qty_assy is the qty of each part (part_id) that belongs to an assembly (assy). Assembly number assy can also be a part_id and in that case is called a sub-assembly and has

Problem with bk tree of MySQL 4.1 for two days.

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 I have been unable to use the bk client to update my bk trees. I just hangs /usr/local/bin/bk-update bk://mysql.bkbits.net/mysql-4.1 mysql-4.1 I usually run this every 4 hours to keep my local trees up to date. The process usually completes in a

Re: Nested Set Model or modified preorder tree traversal mySQL/PHP code wanted

Daevid, I've been searching the web for the past few hours trying to find a simple drop-in class or functions to implement Nested Set Model or modified preorder tree traversal. The reason there's not a drop-in module may be that adding the layers implementing such generality would slow

Nested Set Model or modified preorder tree traversal mySQL/PHP code wanted

I've been searching the web for the past few hours trying to find a simple drop-in class or functions to implement Nested Set Model or modified preorder tree traversal. I've found several tutorials and related links: http://dev.mysql.com/tech-resources/articles/hierarchical-data.html http

Re: display a hierarchic tree

| ++---+-+---+---+-+ 10 rows in set (0.24 sec) and I want to display a tree like: Software Virenscanner Linux Debian Woody Windows Windowsd XP Packprogramm Sniffer Hardware Vermischtes

Re: display a hierarchic tree

| ++---+-+---+---+-+ 10 rows in set (0.24 sec) and I want to display a tree like: Software Virenscanner Linux Debian Woody Windows Windowsd XP Packprogramm Sniffer Hardware Vermischtes

display a hierarchic tree

| Vermischtes | 0 | 0 | ++---+-+---+---+-+ 10 rows in set (0.24 sec) and I want to display a tree like: Software Virenscanner Linux Debian Woody Windows

Re: display a hierarchic tree

Jochen, ...I want to display a tree like: Software Virenscanner Linux Debian Woody Windows Windowsd XP Packprogramm Sniffer Hardware Vermischtes It looks more like

Re: display a hierarchic tree

Hi Jochen. An alternative approach could be to pull all the values out of the database using select * from ..., and then build the tree-structure in your application logic. Insert the relevant values returned from mysql in the appropriate places of the tree-structure in the app code. Keith

Re: B-tree index question

*snip* Yes. B-tree is always balanced: http://www.nist.gov/dads/HTML/btree.html Regards, Sergei *snip* You are right, B+Trees are always balanced but When you insert in increasing order all your inserts will be to the last leaf of the B+tree. This means that you can get some concurrency

Re: B-tree index question

From: Sergei Golubchik [EMAIL PROTECTED] But for auto_increment field (on BIGINT, I believe ?), you'll have hundreds of keys on one key page, so logarithm base will be few hundreds, and log N should be just 3-5. That is, it should be only ~3-5 times slower as compared to the table with one hundred

Re: B-tree index question

] To: Phil Bitis [EMAIL PROTECTED] Cc: [EMAIL PROTECTED] Sent: Thursday, October 21, 2004 2:45 AM Subject: Re: B-tree index question If you are using MyISAM tables, have you thought about using MERGE tables instead? You could partition your table into several smaller tables. I don't know how

Re: B-tree index question

Hi! On Oct 21, Mads Kristensen wrote: *snip* Yes. B-tree is always balanced: http://www.nist.gov/dads/HTML/btree.html Regards, Sergei *snip* You are right, B+Trees are always balanced but When you insert in increasing order all your inserts will be to the last leaf of the B

Re: B-tree index question

Hi! On Oct 21, Phil Bitis wrote: From: Sergei Golubchik [EMAIL PROTECTED] But for auto_increment field (on BIGINT, I believe ?), you'll have hundreds of keys on one key page, so logarithm base will be few hundreds, and log N should be just 3-5. That is, it should be only ~3-5 times slower

Re: B-tree index question

is never joined to other tables. Is there any way we could implement the index ourselves, by modifying the MyISAM table handler perhaps? Or writing our own? Hmm, MyISAM can only do B-tree indexes. It won't be easy to add a completely different index algorithm to it. Writing your own table handler

Re: B-tree index question

of indexes, including primary keys? - Original Message - From: mos [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Wednesday, October 20, 2004 4:20 AM Subject: Re: B-tree index question Phil, The fastest method to load data into a table is to use Load Data Infile. If the table is empty

Re: B-tree index question

- From: Sergei Golubchik [EMAIL PROTECTED] To: Phil Bitis [EMAIL PROTECTED] Cc: [EMAIL PROTECTED] Sent: Wednesday, October 20, 2004 9:23 AM Subject: Re: B-tree index question Hi! On Oct 23, Phil Bitis wrote: Hello, We want to be able to insert records into a table containing a billion records

Re: B-tree index question

If you are using MyISAM tables, have you thought about using MERGE tables instead? You could partition your table into several smaller tables. I don't know how the performance would be on a billion record table, but from my understanding it would shrink your index down.

B-tree index question

someone shed some light on how B-tree indexes work. Do they behave well when values passed in are sequential (1, 2, 3, ...) rather than random values? Thanks in advance, -Phil

Re: B-tree index question

to get to the record. Also, could someone shed some light on how B-tree indexes work. Do they behave well when values passed in are sequential (1, 2, 3, ...) rather than random values? Thanks in advance, -Phil Phil, The fastest method to load data into a table is to use Load Data Infile

tree structure

Hi, Does anybody has a simple idea to store a tree structure under mySQL 4.1.5? I have one table with id, familyType,superFamily,family, for example: +-+---++ | id | familyId | accession | +-+---++ | 287 |22 | . | | 288

Re: tree structure

On 18 Oct 2004 at 15:27, Melanie wrote: Hi, Does anybody has a simple idea to store a tree structure under mySQL 4.1.5? I have one table with id, familyType,superFamily,family, for example: Hi, This tutorial (PHP + MySQL) shows a few different methods: http://www.sitepoint.com/article

Re: tree structure

Thank you very much, I made my search with too few words... :-) the modified pre-order tree transversal seems interesting, but if I want to modify one element I have to go through the whole table to re-index everythingand I would like to avoid to use recursive methods.. I'm currently using

Re: explain tree like structure? Code available? Examples?

Hi Chris, Hmm The question is, does MySQL's optimiser do enough planing to result in a tree of any non-trivial interest? I don't know - apparently, you think it doesn't? I love MySQL as much as the next geek with a significant other that loves dolphins, but I'm not sure that MySQL 4.0

explain tree like structure? Code available? Examples?

Hi, I was wondering if there's a neat way to get the explain output in a tree-like structure so it can be visualized in an easy way. Is it possible to get it into a tree-structure at all? With regards, Martijn Tonies Database Workbench - developer tool for InterBase, Firebird, MySQL MS SQL

Re: explain tree like structure? Code available? Examples?

Hmm The question is, does MySQL's optimiser do enough planing to result in a tree of any non-trivial interest? I love MySQL as much as the next geek with a significant other that loves dolphins, but I'm not sure that MySQL 4.0 would provide a lot of data for funky tree-drawing (MS SQL

SELF JOIN implementing a logical tree on one table

Hi Mysqlers, I have a table which implements a tree-like heirarchy: In the example below a geographical heirarchy. I would like to be able to pick a node in the tree and Get everything logically below that node in the heirarchy: (A self join?) # # Table structure for `tree` # CREATE TABLE

RE: SELF JOIN implementing a logical tree on one table

Mellon [mailto:[EMAIL PROTECTED] Sent: Thursday, February 12, 2004 4:38 AM To: [EMAIL PROTECTED] Subject: SELF JOIN implementing a logical tree on one table Hi Mysqlers, I have a table which implements a tree-like heirarchy: In the example below a geographical heirarchy. I would like to be able

Modified Preorder Tree Traversal

to the tree. I can't see the error... No-one actually posted a correction, just made comments that the original code was wrong. Anyone care to have a look and tell me what's up with the method of adding a child ( on page 3 of the article )? Thanks! Dan -- Daniel Kasak IT Developer NUS Consulting

RE: Tree-like structure: make it simply

: Tree-like structure: make it simply I think I can help with questions 1 and 3... see below, - Original Message - From: Alex E.Wintermann [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Thursday, December 04, 2003 11:44 PM Subject: Tree-like structure: make it simply Hello

Re[2]: Tree-like structure: make it simply

. it means: if we have `id`=18, we must build following string after mentioned recurse search runnnig. string: subsubcat 1 + subcat 2 + cat.1 + root it's tree: /**/ root (`id`=0, `parent`=0) |--cat.1 (`id`=7, `parent`=0) | |-subcat 1 | |--subcat 2 (`id`=13, `parent`=7) | | |-subsubcat 1 (`id`=18

Tree-like structure: make it simply

Hello mysql, I have some table: /* BEGIN DUMP */ CREATE TABLE `sp_tovar_vid` ( `id` int(11) NOT NULL auto_increment, `id_tovar_vid` int(11) NOT NULL default '0', `name` varchar(100) NOT NULL default '', `description` varchar(255) NOT NULL

Re: Tree-like structure: make it simply

I think I can help with questions 1 and 3... see below, - Original Message - From: Alex E.Wintermann [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Thursday, December 04, 2003 11:44 PM Subject: Tree-like structure: make it simply Hello mysql, I have some table: /* BEGIN DUMP

Building from the develepment tree (windows)

I'm trying to build mysql from the development sources of mysql 4.1., retreived using bitkeeper under win2k using cygwin. I have made bk -r edit, and now I'm having a problem running aclocal: aclocal: configure.in: 450: macro `AM_PROG_AS' not found in library When I make automake --version and

Re: Binary tree

On Thu, Jul 03, 2003 at 10:49:59PM +0200, awarsd wrote: Hi, I think MySQL uses binary tree, but my question is that what happens when we delete record. Does the binary regenerate itself?? MySQL handles tree (re-)balancing when necessary. Jeremy -- Jeremy D. Zawodny | Perl, Web, MySQL

Binary tree

Hi, I think MySQL uses binary tree, but my question is that what happens when we delete record. Does the binary regenerate itself?? thanx -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe:http://lists.mysql.com/[EMAIL PROTECTED]

RE: Binary tree

Mysql uses a btree+ ---Original Message- --From: awarsd [mailto:[EMAIL PROTECTED] --Sent: Thursday, July 03, 2003 1:50 PM --To: [EMAIL PROTECTED] --Subject: Binary tree -- --Hi, -- --I think MySQL uses binary tree, but my question is that what happens when --we --delete record. Does

Compiling MySQL 5 Tree

I need a correct configure.in file. That file from site cannot be compiled in cygwin. Please help me. Iulian

Making MySQL 5.0 Source Tree

conversion from UNIX to DOS. I need help to be able to compile MySQL 5.0 source tree. Sincerely Yours, Iulian Information System Officer/Economist Falticeni, jud. Suceava Romania, Europe

Re: Conception - Tree - Recursivity -Address book - Query speed

Thank you very much for your answer. I read the article. I've understood that this nested tree model (with the worm, I liked the image), permits to retrive very easiely the path of a node, and some other things. But : I've understood that if we want to modify the tree, all left and right

RE: Conception - Tree - Recursivity -Address book - Query speed

a columnar result set can't obviously look like a tree. As for having to update a large portion of the tree to add or subtract one node, yes. That's necessary. But for the cases I've dealt with, this is business structure data, and it changes very rarely by comparison to daily transactional

Re: Conception - Tree - Recursivity -Address book - Query speed

On Wed, 02 Apr 2003 16:53:44 +0200, Grégoire Dubois [EMAIL PROTECTED] wrote: Creating the tree doesn't give me problem. Where I ask me some questions, is the speed to get the whole tree from the database in a recursive way. I've made a PHP script doing genealogical descendancy charts that does

Conception - Tree - Recursivity -Address book - Query speed

- ID Name ID_father (the reference to the father directory) Creating the tree doesn't give me problem. Where I ask me some questions, is the speed to get the whole tree from the database in a recursive way. The way the tree is defined in the database, I will be obliged to make

RE: Conception - Tree - Recursivity -Address book - Query speed

] Subject: Conception - Tree - Recursivity -Address book - Query speed Hello all, I am putting multiple address book (trees) into a MySQL database. These address book are made of directories and persons. It gives something like that for the tables : Directory -- ID

Select leaf nodes from tree

Hi, Given a simple tree structure represented in a table shown below: group_id: int parent_group_id: int description: varchar I am trying to select all rows from a table where the group_id does not appear elsewhere as a parent_group_id, hence selecting only the leaf nodes. I have wrestled

VPATH build fails with in-tree Berkeley DB

with in-tree Berkeley DB Severity: serious Priority: medium Category: mysql Class: sw-bug Release: mysql-3.23.55 (Source distribution) Environment: System: SunOS padouk 5.8 Generic_108528-18 sun4u sparc SUNW,Sun-Fire-880 Architecture: sun4 Some paths: /vol

Compiling on W2K using MSC 6.0 from source tree.

I have downloaded the source (3.23.55) tree using Bitkeeper. What is the best way to compile MySQL for Windows using MSC++ 6.0. I noticed the files (*.dsw, *.dsp) under the directory VC++Files. When I try to compile any of the projects, MSC is unable to locate the source files. Do I need

Re: Password function not working with latest 4.1 tree

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On Thu, 19 Dec 2002 [EMAIL PROTECTED] wrote: Description: with the latest 4.1 tree (from today) the PASSWORD() function returns random alpha-numeric text /[a-f0-9]/ 45 characters in length (which is too long for a password string

Re: Password function not working with latest 4.1 tree

Yes, that's intentional - we have changed this in 4.1, but it's not documented in the manual yet. A quote from the developer working on that code: So, the PASSWORD() function is now not to be used for passwords? The problem is that I have built at least a few applications that use PASSWORD() as

Password function not working with latest 4.1 tree

Description: with the latest 4.1 tree (from today) the PASSWORD() function returns random alpha-numeric text /[a-f0-9]/ 45 characters in length (which is too long for a password string). The string always starts with a * (asterisk). example

Error running autoheader on a new clone of src tree for 4.0

I am trying to build MySQL from a new clone of the bitkeeper repository, and am running into some difficulty... I am running Debian Woody, and am running unstable. Following are the relevant utilities/versions installed on my system:

Building from CVS tree for Windows

I want to use the LOAD DATA FROM MASTER feature from 4.0, but I cannot use 4.0.1 because of the bugs in FULLTEXT. I believed that these bugs are now fixed but 4.0.2 seems to be an awfully long time coming, so I thought I would try to build a later version from the CVS sources. Can anybody give me

Re: Building from CVS tree for Windows

PROTECTED] [EMAIL PROTECTED] - Original Message - From: [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Tuesday, June 25, 2002 3:15 PM Subject: Building from CVS tree for Windows I want to use the LOAD DATA FROM MASTER feature from 4.0, but I cannot use

Re: SV: building tree view in mysql?

in the SORT - values. There are other advantages: If you count the :, denn you can see how deep you are in the Tree. If your user clicked on the tree and you know the value of the sort - fields the user clicked on, you know, whether the item you are outputting is on the way to your selected item

Re: SV: building tree view in mysql?

in the SORT - values. There are other advantages: If you count the :, denn you can see how deep you are in the Tree. If your user clicked on the tree and you know the value of the sort - fields the user clicked on, you know, whether the item you are outputting is on the way to your selected item

Re: SV: building tree view in mysql?

by SORT that's very fast, witch is far more important that the overhead you have to fill in the SORT - values. There are other advantages: If you count the :, denn you can see how deep you are in the Tree. If your user clicked on the tree and you know the value of the sort - fields the user clicked

Re: building tree view in mysql?

HI, For trees you need self joins. Could You please explain that ? Regards, At 19:11 23/05/02, Georg Richter wrote: On Thursday, 23. May 2002 16:16, Sagi Bashari wrote: Hi, snip How can I get MySQL to sort it like that? I tried to use group/order by, but I cannot get it to

Re: building tree view in mysql?

create a table like this: id | parent_id | category parent_id points to the parent categories id. Top level categories get parent_id of '0' ex: 1 | 0 | auto 2 | 1 | repair 3 | 2 | body 4 | 2 | windshields 5 | 1 | detailing 6 | 2 | tires Tree would look like: auto repair body

Re: building tree view in mysql?

this: id | parent_id | category parent_id points to the parent categories id. Top level categories get parent_id of '0' ex: 1 | 0 | auto 2 | 1 | repair 3 | 2 | body 4 | 2 | windshields 5 | 1 | detailing 6 | 2 | tires Tree would look like: auto repair body windshields

SV: building tree view in mysql?

[mailto:[EMAIL PROTECTED]] Sendt: 27. maj 2002 20:50 Til: olinux; [EMAIL PROTECTED]; [EMAIL PROTECTED] Emne: Re: building tree view in mysql? Yeah, thats exactly what I wanted to do. But how do I make MySQL sort it like that? Show the parent first, and then all its childs, so the application can

Re: building tree view in mysql?

). - Carsten -Oprindelig meddelelse- Fra: Sagi Bashari [mailto:[EMAIL PROTECTED]] Sendt: 27. maj 2002 20:50 Til: olinux; [EMAIL PROTECTED]; [EMAIL PROTECTED] Emne: Re: building tree view in mysql? Yeah, thats exactly what I wanted to do. But how do I make MySQL sort it like

SV: building tree view in mysql?

call. The trick is, that to make a tree you always need to use recursive functions. The performance is gained by loading the complete list from database at once (instead of calling a mysql SELECT statement for each branch of the tree). - Carsten -Oprindelig meddelelse- Fra: Carsten

building tree view in mysql?

Hi, I'm trying to build a simple categories tree in MySQL. Say I have the following table: CREATE TABLE test ( id int(10) unsigned NOT NULL auto_increment, parent int(10) unsigned NOT NULL default '0', name tinytext NOT NULL, PRIMARY KEY (id), KEY parent (parent) ) TYPE=MyISAM

Re: FreeBSD LinuxThreads from BK Tree?

In the last episode (May 22), Jeremy Zawodny said: Has anyone built MySQL 4.x from the BitKeeper tree using LinuxThreads on FreeBSD? If so, how'd you do it? It looks like someone is in the process of removing getopt_long() usage from the commandline tools. They're doing it backwards

Re: building tree view in mysql?

On Thursday, 23. May 2002 16:16, Sagi Bashari wrote: Hi, snip How can I get MySQL to sort it like that? I tried to use group/order by, but I cannot get it to sort it this way.. Any ideas? /snip For trees you need self joins. Regards Georg mysql, query

Re: FreeBSD LinuxThreads from BK Tree?

On Thu, May 23, 2002 at 10:02:51AM -0500, Dan Nelson wrote: In the last episode (May 22), Jeremy Zawodny said: Has anyone built MySQL 4.x from the BitKeeper tree using LinuxThreads on FreeBSD? If so, how'd you do it? It looks like someone is in the process of removing getopt_long

RE: building tree view in mysql?

path0-1-1 2 path0-2 1 path1 0 path1-0 5 path1-5 etc... It more simple, more scalable, and it is (I guess!!) the simplest way for sorting results as a tree over a HTML format! The way you store data in your DB depends on the way you output data too

FreeBSD LinuxThreads from BK Tree?

Has anyone built MySQL 4.x from the BitKeeper tree using LinuxThreads on FreeBSD? If so, how'd you do it? Thanks, Jeremy -- Jeremy D. Zawodny, [EMAIL PROTECTED] Technical Yahoo - Yahoo Finance Desk: (408) 349-7878 Fax: (408) 349-5454 Cell: (408) 685-5936

Re: Active maintenance of 3.23 tree

Hi, - Original Message - From: DownloadFAST.com [EMAIL PROTECTED] To: Ben Gollmer [EMAIL PROTECTED] Cc: [EMAIL PROTECTED] Or does MySQL actively support, debug, fix, and go back and maintain older releases? That is indeed the case. The 3.23 and 4.0 branches co-exist, and we still do

Re: Tree in SQL

In the last episode (Oct 22), Daniel _a_ said: I have a table in database which describes tree structure of article groups. In this table I have: 1. group_id - group identifier 2. parent_group_id - identifier of parent group I need to select history, from top to wanted group. I can't change

RE: Tree in SQL

:) If the depth of the tree is always the same, it is actually fairly easy. For instance, if there are three levels: SELECT c.group_id FROM table a, table b, table c WHERE a.group_id = 12345 AND b.group_id = a.parent_group_id AND c.group_id = b.parent_group_id If you don't know

Tree in SQL

Hi I have a table in database which describes tree structure of article groups. In this table I have: 1. group_id - group identifier 2. parent_group_id - identifier of parent group I need to select history, from top to wanted group. I can't change the database design and ofcourse this is MySQL

RE: Tree in SQL

If the depth of the tree is always the same, it is actually fairly easy. For instance, if there are three levels: SELECT c.group_id FROM table a, table b, table c WHERE a.group_id = 12345 AND b.group_id = a.parent_group_id AND c.group_id = b.parent_group_id If you don't know the depth

ODP: Tree in SQL

wiadomo- Od: Steve Meyers [mailto:[EMAIL PROTECTED]] Wysano: 23 padziernika 2001 07:44 Do: Daniel Lao; Lista MySQL Temat: RE: Tree in SQL If the depth of the tree is always the same, it is actually fairly easy. For instance, if there are three levels: SELECT c.group_id FROM table

ODP: Tree in SQL

Thank you. I was trying too long to do this in SQL. -Oryginalna wiadomoœæ- Od: Dan Nelson [mailto:[EMAIL PROTECTED]] Wys³ano: 22 paŸdziernika 2001 23:38 Do: Daniel _a_ DW: Lista MySQL Temat: Re: Tree in SQL In the last episode (Oct 22), Daniel _a_ said: I have a table

Traversing a tree structure in MySQL

I'm in the process of building a tree-structured message base, or rather porting software I wrote back in mid-80s to the web. This isn't the ubiquitous threaded BBS software. It's tree-structured. This means that every message on the message base is related through a single ancestor, Msg #0

Speaking of tree searches

I have an upcoming project which will require me doing a recursive function in PHP, doing a tree calculating optimum route between defined points in the database. The function is going to have to do a SELECT on the MySQL database on each iteration. It could concievably do thousands

Re: Speaking of tree searches

--- Frank Fisher [EMAIL PROTECTED] wrote: I have an upcoming project which will require me doing a recursive function in PHP, doing a tree calculating optimum route between defined points in the database. Maybe it's just me, but it sounds like you need to reconsider you're database

Re: Speaking of tree searches

Hans Zaunere wrote: Maybe it's just me, but it sounds like you need to reconsider you're database structure. I can't think of any reason that such a schema would be required. It's simply a database of locations on the globe, and I need to calculate how to get to one place from another

Re: Speaking of tree searches

Definitely pull the data out into an array with one large query. It'll be much faster than the thousands/millions of queries you'd be generating otherwise. Graph-theory problems like this go exponential really fast. Rene At 02:05 PM 8/20/01, you wrote: Hans Zaunere wrote: Maybe it's

Tree

hello, does mysql allow for recursive SELECTS? is there a way to select a 'path in a tree' in one query ? (the tree is stored in the following form: parent_id int id int ) i know the ID of an element in n-th level of the tree, and i need to get all its parent elements