숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4154
-- 카테고리 테이블을 작성한다.
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 조회 3,954
11-12-23 조회 2,910
11-12-23 조회 4,726
11-12-23 조회 4,318
11-12-23 조회 2,681
11-12-23 조회 8,017
11-12-22 조회 3,005
11-12-22 조회 3,745
11-12-22 조회 3,478
11-12-22 조회 3,375
11-12-22 조회 3,574
11-12-21 조회 3,430
11-12-21 조회 3,188
11-12-21 조회 3,509
11-12-21 조회 3,897
11-12-21 조회 2,939
11-12-21 조회 3,439
11-12-21 조회 4,375
11-12-21 조회 4,193
11-12-21 조회 3,209
11-12-20 조회 3,671
11-12-19 조회 6,184
11-12-19 조회 2,859
11-12-19 조회 4,948
11-12-17 조회 3,799
11-12-17 조회 4,155
11-12-17 조회 3,439
11-12-16 조회 3,077
11-12-16 조회 3,227
11-12-15 조회 3,272
11-12-15 조회 3,378
11-12-15 조회 4,172
11-12-15 조회 5,448
11-12-15 조회 4,451
11-12-15 조회 3,131
11-12-15 조회 3,923
11-12-15 조회 4,098
11-12-14 조회 2,857
11-12-14 조회 4,268
11-12-14 조회 5,495
11-12-13 조회 4,041
11-12-13 조회 4,956
11-12-13 조회 5,999
11-12-13 조회 6,303
11-12-13 조회 4,706
11-12-12 조회 3,201
11-12-12 조회 3,480
11-12-12 조회 6,149
11-12-12 조회 4,524
11-12-12 조회 3,671
11-12-12 조회 6,046
11-12-11 조회 4,598
11-12-10 조회 2,721
11-12-10 조회 4,671
11-12-09 조회 2,775
11-12-09 조회 3,193
11-12-09 조회 4,104
11-12-09 조회 3,735
11-12-09 조회 3,910
11-12-09 조회 3,482
11-12-09 조회 4,434
11-12-09 조회 3,117
11-12-09 조회 3,266
11-12-09 조회 2,916
11-12-09 조회 3,703
11-12-08 조회 3,452
11-12-08 조회 3,412
11-12-08 조회 7,730
11-12-08 조회 4,073
11-12-08 조회 3,569
11-12-08 조회 2,841
11-12-08 조회 1.2만
11-12-08 조회 3,929
11-12-07 조회 2,800
11-12-07 조회 2,835
11-12-07 조회 3,816
11-12-07 조회 4,443
11-12-07 조회 3,921
11-12-07 조회 3,020
11-12-07 조회 4,350
11-12-06 조회 4,257
11-12-06 조회 5,583
11-12-06 조회 3,632
11-12-06 조회 3,557
11-12-05 조회 2,993
11-12-05 조회 3,279
11-12-05 조회 4,506
11-12-05 조회 3,260
11-12-05 조회 4,873
11-12-05 조회 2,842
11-12-05 조회 5,896
11-12-05 조회 3,029
11-12-05 조회 4,371
11-12-04 조회 5,681
11-12-04 조회 2,921
11-12-04 조회 3,272
11-12-03 조회 3,582
11-12-03 조회 2,951
11-12-03 조회 3,533
11-12-03 조회 3,438