숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4214
-- 카테고리 테이블을 작성한다.
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-04-26 조회 3,840
12-04-24 조회 3,233
12-04-23 조회 4,569
12-04-22 조회 3,258
12-04-19 조회 3,342
12-04-18 조회 4,396
12-04-18 조회 3,106
12-04-17 조회 3,375
12-04-17 조회 5,135
12-04-16 조회 3,558
12-04-13 조회 3,105
12-04-09 조회 3,169
12-04-04 조회 3,941
12-04-01 조회 3,216
12-03-31 조회 3,615
12-03-30 조회 3,222
12-03-30 조회 3,884
12-03-26 조회 3,501
12-03-26 조회 3,077
12-03-22 조회 3,225
12-03-21 조회 3,079
12-03-19 조회 3,490
12-03-17 조회 3,517
12-03-14 조회 3,248
12-03-10 조회 3,929
12-03-09 조회 3,517
12-03-09 조회 3,334
12-03-08 조회 3,813
12-03-08 조회 3,980
12-03-08 조회 4,073
12-03-03 조회 3,329
12-03-02 조회 4,649
12-02-28 조회 3,186
12-02-27 조회 3,003
12-02-25 조회 3,144
12-02-24 조회 3,855
12-02-23 조회 3,120
12-02-22 조회 3,635
12-02-22 조회 5,405
12-02-22 조회 3,978
12-02-22 조회 4,298
12-02-18 조회 3,792
12-02-17 조회 3,012
12-02-17 조회 3,424
12-02-14 조회 3,494
12-02-13 조회 3,371
12-02-10 조회 1만
12-02-08 조회 3,034
12-02-07 조회 3,373
12-02-06 조회 3,097
12-02-05 조회 3,562
12-01-31 조회 3,487
12-01-30 조회 9,673
12-01-29 조회 3,834
12-01-26 조회 3,431
12-01-25 조회 4,044
12-01-24 조회 3,436
12-01-10 조회 3,748
12-01-10 조회 4,506
12-01-09 조회 3,282
12-01-08 조회 7,142
12-01-08 조회 3,666
12-01-07 조회 5,193
12-01-04 조회 3,898
12-01-02 조회 3,124
12-01-02 조회 3,179
12-01-02 조회 3,480
12-01-01 조회 3,118
11-12-31 조회 3,422
11-12-31 조회 3,108
11-12-30 조회 3,271
11-12-30 조회 3,428
11-12-29 조회 3,638
11-12-28 조회 3,724
11-12-26 조회 3,302
11-12-23 조회 3,520
11-12-22 조회 3,061
11-12-15 조회 4,155
11-12-08 조회 3,964
11-12-05 조회 3,307
11-12-04 조회 5,721
11-12-03 조회 3,595
11-12-02 조회 3,369
11-12-01 조회 5,437
11-11-30 조회 2,920
11-11-30 조회 2,825
11-11-28 조회 3,167
11-11-26 조회 3,352
11-11-25 조회 3,369
11-11-24 조회 2,963
11-11-22 조회 3,058
11-11-22 조회 2,899
11-11-17 조회 2,834
11-11-11 조회 2,829
11-11-09 조회 2,883
11-11-08 조회 3,261
11-11-08 조회 2,555
11-11-04 조회 3,635
11-11-01 조회 2,942
11-10-26 조회 2,531