숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4236
-- 카테고리 테이블을 작성한다.
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-12-23 조회 4,028
11-12-23 조회 2,972
11-12-23 조회 4,795
11-12-23 조회 4,383
11-12-23 조회 2,739
11-12-23 조회 8,086
11-12-22 조회 3,084
11-12-22 조회 3,827
11-12-22 조회 3,573
11-12-22 조회 3,480
11-12-22 조회 3,670
11-12-21 조회 3,520
11-12-21 조회 3,304
11-12-21 조회 3,595
11-12-21 조회 3,969
11-12-21 조회 3,004
11-12-21 조회 3,503
11-12-21 조회 4,437
11-12-21 조회 4,268
11-12-21 조회 3,292
11-12-20 조회 3,761
11-12-19 조회 6,259
11-12-19 조회 2,939
11-12-19 조회 5,012
11-12-17 조회 3,868
11-12-17 조회 4,237
11-12-17 조회 3,524
11-12-16 조회 3,144
11-12-16 조회 3,300
11-12-15 조회 3,332
11-12-15 조회 3,447
11-12-15 조회 4,250
11-12-15 조회 5,539
11-12-15 조회 4,540
11-12-15 조회 3,226
11-12-15 조회 4,006
11-12-15 조회 4,182
11-12-14 조회 2,942
11-12-14 조회 4,350
11-12-14 조회 5,586
11-12-13 조회 4,155
11-12-13 조회 5,042
11-12-13 조회 6,071
11-12-13 조회 6,376
11-12-13 조회 4,780
11-12-12 조회 3,282
11-12-12 조회 3,578
11-12-12 조회 6,229
11-12-12 조회 4,617
11-12-12 조회 3,746
11-12-12 조회 6,125
11-12-11 조회 4,658
11-12-10 조회 2,784
11-12-10 조회 4,725
11-12-09 조회 2,833
11-12-09 조회 3,250
11-12-09 조회 4,157
11-12-09 조회 3,774
11-12-09 조회 3,977
11-12-09 조회 3,535
11-12-09 조회 4,490
11-12-09 조회 3,174
11-12-09 조회 3,322
11-12-09 조회 2,997
11-12-09 조회 3,797
11-12-08 조회 3,570
11-12-08 조회 3,505
11-12-08 조회 7,807
11-12-08 조회 4,134
11-12-08 조회 3,633
11-12-08 조회 2,892
11-12-08 조회 1.2만
11-12-08 조회 3,979
11-12-07 조회 2,854
11-12-07 조회 2,885
11-12-07 조회 3,888
11-12-07 조회 4,524
11-12-07 조회 3,976
11-12-07 조회 3,074
11-12-07 조회 4,403
11-12-06 조회 4,308
11-12-06 조회 5,651
11-12-06 조회 3,700
11-12-06 조회 3,619
11-12-05 조회 3,054
11-12-05 조회 3,344
11-12-05 조회 4,574
11-12-05 조회 3,319
11-12-05 조회 4,937
11-12-05 조회 2,899
11-12-05 조회 5,971
11-12-05 조회 3,099
11-12-05 조회 4,425
11-12-04 조회 5,736
11-12-04 조회 2,975
11-12-04 조회 3,338
11-12-03 조회 3,641
11-12-03 조회 3,010
11-12-03 조회 3,614
11-12-03 조회 3,510