숀패밀리

카테고리에 적합한 쿼리 형식

· 2011-12-17 (토) 11:20:05 · 4232
-- 카테고리 테이블을 작성한다.
DROP TABLE IF EXISTS category ;
CREATE TABLE category(
category_id INT AUTO_INCREMENT PRIMARY KEY,
name VARCHAR(20) NOT NULL,
parent INT DEFAULT NULL);

INSERT INTO category
VALUES(1,'ELECTRONICS',NULL),(2,'TELEVISIONS',1),(3,'TUBE',2),
(4,'LCD',2),(5,'PLASMA',2),(6,'PORTABLE ELECTRONICS',1),
(7,'MP3 PLAYERS',6),(8,'FLASH',7),
(9,'CD PLAYERS',6),(10,'2 WAY RADIOS',6);
SELECT * FROM category ORDER BY category_id;

-- self 조인을 이용한 DEPTH ( LEVEL ) 구현 쿼리
-- 일반적인 방법이다.
SELECT t1.name AS lev1, t2.name as lev2, t3.name as lev3, t4.name as lev4
FROM category AS t1
LEFT JOIN category AS t2 ON t2.parent = t1.category_id
LEFT JOIN category AS t3 ON t3.parent = t2.category_id
LEFT JOIN category AS t4 ON t4.parent = t3.category_id
WHERE t1.name = 'ELECTRONICS';
-- 레벨의 마지막 leaf node 만을 조회
 
SELECT t1.name FROM
category AS t1 LEFT JOIN category as t2
ON t1.category_id = t2.parent
WHERE t2.category_id IS NULL;

-- 한개의 카테고리에 대해 상위 카테고리들 조회
SELECT t1.name AS lev1, t2.name as lev2, t3.name as lev3, t4.name as lev4
FROM category AS t1
LEFT JOIN category AS t2 ON t2.parent = t1.category_id
LEFT JOIN category AS t3 ON t3.parent = t2.category_id
LEFT JOIN category AS t4 ON t4.parent = t3.category_id
WHERE t1.name = 'ELECTRONICS' AND t4.name = 'FLASH';

-- SELF 조인이 아닌 방법을 이용하기 위한 테이블 생성 
DROP TABLE IF EXISTS  nested_category ;
 
CREATE TABLE nested_category (
 category_id INT AUTO_INCREMENT PRIMARY KEY,
 name VARCHAR(20) NOT NULL,
 lft INT NOT NULL,
 rgt INT NOT NULL
);
INSERT INTO nested_category
VALUES(1,'ELECTRONICS',1,20),(2,'TELEVISIONS',2,9),(3,'TUBE',3,4),
(4,'LCD',5,6),(5,'PLASMA',7,8),(6,'PORTABLE ELECTRONICS',10,19),
(7,'MP3 PLAYERS',11,14),(8,'FLASH',12,13),
(9,'CD PLAYERS',15,16),(10,'2 WAY RADIOS',17,18);

-- 당 카테고리가 지니고 있는 하위 카테고리 출력 
SELECT node.name
FROM nested_category AS node,
nested_category AS parent
WHERE node.lft BETWEEN parent.lft AND parent.rgt
AND parent.name = 'PORTABLE ELECTRONICS'
ORDER BY node.lft;
-- 모든 마지막 레벨 조회 
SELECT name
FROM nested_category
WHERE rgt = lft + 1;
-- 해당 카테고리가 소속되는 상위 카테고리 출력
SELECT parent.name
FROM nested_category AS node,
nested_category AS parent
WHERE node.lft BETWEEN parent.lft AND parent.rgt
AND node.name = 'FLASH'
ORDER BY parent.lft;
-- 카테고리별 TREE 의 레벨 출력
SELECT node.name, (COUNT(parent.name) - 1) AS depth
FROM nested_category AS node,
nested_category AS parent
WHERE node.lft BETWEEN parent.lft AND parent.rgt
GROUP BY node.name
ORDER BY node.lft;
|
댓글을 작성하시려면 로그인이 필요합니다.

프로그램

8,188건
+
제목 글쓴이 날짜 조회
11-10-25 조회 2,508
11-10-18 조회 4,045
11-10-18 조회 2,429
11-10-15 조회 3,649
11-10-10 조회 2,707
11-10-02 조회 2,609
11-09-28 조회 2,426
11-09-24 조회 2,518
11-09-22 조회 2,412
11-09-05 조회 2,898
11-08-31 조회 2,275
11-08-31 조회 2,589
11-08-31 조회 2,444
11-08-29 조회 2,982
11-08-28 조회 2,482
11-08-25 조회 2,533
11-08-17 조회 2,249
11-08-16 조회 2,484
11-08-11 조회 2,945
11-08-07 조회 2,652
11-08-03 조회 2,359
11-07-22 조회 2,105
11-07-12 조회 3,322
11-06-27 조회 2,100
11-06-01 조회 1,768
11-05-17 조회 2,562
11-05-01 조회 2,623
11-04-28 조회 2,912
11-04-28 조회 2,970
11-04-13 조회 2,624
11-03-27 조회 2,752
11-03-27 조회 2,623
11-03-14 조회 2,040
11-03-02 조회 2,357
11-03-02 조회 2,593
11-02-27 조회 3,017
11-02-23 조회 2,396
11-02-19 조회 2,537
11-02-14 조회 4,154
11-02-03 조회 2,940
11-01-24 조회 3,890
11-01-04 조회 2,423
10-12-08 조회 5,432
10-11-15 조회 2,441
10-11-14 조회 2,626
10-11-14 조회 3,646
10-10-29 조회 3,712
10-10-19 조회 2,722
10-10-07 조회 2,553
10-10-05 조회 4,464
10-09-18 조회 2,756
10-09-18 조회 2,502
10-09-17 조회 4,909
10-09-15 조회 2,847
10-09-15 조회 2,380
10-09-15 조회 2,862
10-09-15 조회 2,697
10-09-11 조회 4,029
10-09-11 조회 2,525
10-09-11 조회 2,574
10-09-07 조회 3,845
10-09-07 조회 3,386
10-08-29 조회 2,850
10-07-01 조회 3,094
10-06-30 조회 2,499
10-06-30 조회 2,676
10-06-30 조회 3,029
10-06-13 조회 2,065
10-04-15 조회 3,236
10-04-04 조회 3,468
10-02-23 조회 3,578
10-02-09 조회 3,168
10-01-25 조회 2,679
10-01-25 조회 2,779
09-12-27 조회 4,415
09-11-23 조회 3,640
09-11-20 조회 4,881
09-08-30 조회 3,071
09-08-30 조회 3,068
09-08-12 조회 3,040
09-07-22 조회 4,094
09-07-22 조회 4,752
09-07-15 조회 5,910
09-07-11 조회 2,992
09-06-17 조회 2,725
09-06-15 조회 3,017
09-05-29 조회 3,299
09-05-11 조회 5,937
09-05-08 조회 2,693
09-04-30 조회 3,806
09-04-17 조회 3,130
09-04-04 조회 3,311
09-03-05 조회 3,693
09-02-09 조회 3,668
09-02-03 조회 6,167
08-12-27 조회 3,230
08-12-20 조회 4,311
08-11-21 조회 5,273
08-11-14 조회 2,848
08-11-03 조회 3,305