숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4101
-- 카테고리 테이블을 작성한다.
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,926
11-12-23 조회 2,753
11-12-23 조회 4,652
11-12-23 조회 4,156
11-12-23 조회 2,646
11-12-23 조회 7,953
11-12-22 조회 2,954
11-12-22 조회 3,685
11-12-22 조회 3,417
11-12-22 조회 3,195
11-12-22 조회 3,467
11-12-21 조회 3,342
11-12-21 조회 3,145
11-12-21 조회 3,475
11-12-21 조회 3,868
11-12-21 조회 2,892
11-12-21 조회 3,359
11-12-21 조회 4,341
11-12-21 조회 4,160
11-12-21 조회 3,163
11-12-20 조회 3,613
11-12-19 조회 6,130
11-12-19 조회 2,805
11-12-19 조회 4,892
11-12-17 조회 3,620
11-12-17 조회 4,102
11-12-17 조회 3,297
11-12-16 조회 3,037
11-12-16 조회 3,110
11-12-15 조회 3,234
11-12-15 조회 3,302
11-12-15 조회 4,145
11-12-15 조회 5,409
11-12-15 조회 4,409
11-12-15 조회 3,089
11-12-15 조회 3,861
11-12-15 조회 4,008
11-12-14 조회 2,777
11-12-14 조회 4,160
11-12-14 조회 5,433
11-12-13 조회 3,989
11-12-13 조회 4,907
11-12-13 조회 5,948
11-12-13 조회 6,233
11-12-13 조회 4,629
11-12-12 조회 3,027
11-12-12 조회 3,391
11-12-12 조회 6,100
11-12-12 조회 4,474
11-12-12 조회 3,632
11-12-12 조회 6,015
11-12-11 조회 4,569
11-12-10 조회 2,688
11-12-10 조회 4,641
11-12-09 조회 2,742
11-12-09 조회 3,076
11-12-09 조회 4,019
11-12-09 조회 3,647
11-12-09 조회 3,861
11-12-09 조회 3,376
11-12-09 조회 4,390
11-12-09 조회 3,069
11-12-09 조회 3,106
11-12-09 조회 2,864
11-12-09 조회 3,649
11-12-08 조회 3,383
11-12-08 조회 3,227
11-12-08 조회 7,571
11-12-08 조회 4,037
11-12-08 조회 3,440
11-12-08 조회 2,816
11-12-08 조회 1.2만
11-12-08 조회 3,887
11-12-07 조회 2,760
11-12-07 조회 2,794
11-12-07 조회 3,764
11-12-07 조회 4,365
11-12-07 조회 3,818
11-12-07 조회 2,995
11-12-07 조회 4,326
11-12-06 조회 4,226
11-12-06 조회 5,441
11-12-06 조회 3,573
11-12-06 조회 3,545
11-12-05 조회 2,978
11-12-05 조회 3,209
11-12-05 조회 4,464
11-12-05 조회 3,211
11-12-05 조회 4,828
11-12-05 조회 2,820
11-12-05 조회 5,831
11-12-05 조회 2,942
11-12-05 조회 4,337
11-12-04 조회 5,639
11-12-04 조회 2,898
11-12-04 조회 3,151
11-12-03 조회 3,532
11-12-03 조회 2,925
11-12-03 조회 3,490
11-12-03 조회 3,388