숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4203
-- 카테고리 테이블을 작성한다.
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건
+
제목 글쓴이 날짜 조회
12-03-19 조회 3,568
12-03-16 조회 4,102
12-03-14 조회 3,984
12-03-13 조회 3,597
12-03-13 조회 4,446
12-03-12 조회 5,542
12-03-12 조회 1만
12-03-08 조회 6,103
12-03-06 조회 1.1만
12-03-06 조회 3,809
12-03-06 조회 6,315
12-03-02 조회 5,108
12-02-29 조회 3,658
12-02-27 조회 4,168
12-02-22 조회 3,709
12-02-20 조회 3,684
12-02-20 조회 6,767
12-02-01 조회 3,296
12-01-30 조회 8,835
12-01-29 조회 3,318
12-01-24 조회 3,649
12-01-21 조회 3,299
12-01-10 조회 3,759
11-12-26 조회 3,673
11-12-23 조회 5,094
11-12-23 조회 4,745
11-12-23 조회 4,345
11-12-23 조회 8,054
11-12-22 조회 3,791
11-12-17 조회 3,837
11-12-12 조회 3,248
11-12-08 조회 7,772
11-12-08 조회 3,606
11-12-07 조회 3,860
11-12-06 조회 5,624
11-12-02 조회 3,570
11-12-01 조회 3,185
11-11-30 조회 6,984
11-11-26 조회 3,935
11-11-24 조회 4,691
11-11-22 조회 3,074
11-11-22 조회 6,694
11-11-18 조회 5,117
11-11-16 조회 3,494
11-11-14 조회 3,512
11-11-12 조회 3,993
11-11-08 조회 3,325
11-11-06 조회 1만
11-11-06 조회 3,903
11-11-03 조회 5,591
11-11-02 조회 5,871
11-11-01 조회 9,383
11-10-19 조회 2,884
11-10-17 조회 2,677
11-10-10 조회 2,647
11-10-07 조회 3,407
11-10-06 조회 3,995
11-10-06 조회 2,552
11-10-02 조회 3,310
11-09-08 조회 4,323
11-09-08 조회 2,698
11-09-07 조회 2,669
11-09-02 조회 2,765
11-09-01 조회 3,711
11-08-28 조회 3,598
11-08-23 조회 3,426
11-08-22 조회 2,847
11-08-22 조회 2,439
11-08-13 조회 2,496
11-08-05 조회 2,933
11-08-03 조회 4,142
11-07-03 조회 2,619
11-06-15 조회 3,267
11-06-15 조회 3,098
11-05-15 조회 2,908
11-05-11 조회 5,630
11-04-12 조회 3,049
11-01-27 조회 3,874
11-01-26 조회 2,669
11-01-26 조회 4,507
11-01-18 조회 2,719
10-11-23 조회 2,954
10-10-24 조회 4,764
10-09-15 조회 4,457
10-09-07 조회 3,444
10-08-27 조회 4,118
10-08-20 조회 7,002
10-07-30 조회 5,686
10-06-30 조회 2,950
10-06-11 조회 4,702
10-06-11 조회 3,395
10-05-15 조회 4,237
10-05-10 조회 2,923
10-03-19 조회 5,468
10-03-05 조회 5,228
10-02-17 조회 5,662
09-11-21 조회 6,977
09-11-09 조회 4,043
09-11-04 조회 6,771
09-10-26 조회 3,899