숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4073
-- 카테고리 테이블을 작성한다.
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-01-22 조회 3,478
12-01-21 조회 2,790
12-01-19 조회 4,808
12-01-18 조회 2,761
12-01-18 조회 2,784
12-01-18 조회 2,990
12-01-17 조회 2,758
12-01-17 조회 2,973
12-01-14 조회 1.1만
12-01-14 조회 3,522
12-01-14 조회 3,835
12-01-11 조회 3,193
12-01-11 조회 3,068
12-01-11 조회 3,007
12-01-11 조회 3,049
12-01-11 조회 3,395
12-01-11 조회 2,595
12-01-10 조회 3,013
12-01-10 조회 2,793
12-01-10 조회 2,800
12-01-09 조회 2,742
12-01-08 조회 2,785
12-01-07 조회 2,775
12-01-06 조회 2,636
12-01-06 조회 2,758
12-01-05 조회 2,754
12-01-02 조회 2,910
11-12-29 조회 2,759
11-12-28 조회 2,763
11-12-28 조회 2,739
11-12-27 조회 2,987
11-12-23 조회 2,693
11-12-23 조회 2,743
11-12-21 조회 3,860
11-12-21 조회 2,850
11-12-19 조회 2,799
11-12-14 조회 4,111
11-12-08 조회 3,185
11-12-08 조회 4,029
11-12-07 조회 4,321
11-12-06 조회 4,222
11-12-06 조회 3,526
11-12-05 조회 3,158
11-12-05 조회 4,793
11-12-04 조회 3,134
11-12-03 조회 3,493
11-12-02 조회 3,359
11-12-02 조회 3,444
11-12-02 조회 2,779
11-12-01 조회 2,747
11-12-01 조회 3,650
11-12-01 조회 2,736
11-11-29 조회 5,623
11-11-23 조회 3,559
11-11-23 조회 3,858
11-11-22 조회 3,878
11-11-22 조회 2,922
11-11-21 조회 3,481
11-11-21 조회 2,767
11-11-18 조회 3,863
11-11-18 조회 3,039
11-11-17 조회 2,931
11-11-17 조회 2,933
11-11-17 조회 4,491
11-11-11 조회 2,796
11-11-11 조회 2,797
11-11-11 조회 3,931
11-11-11 조회 4,619
11-11-08 조회 2,904
11-11-06 조회 3,347
11-11-06 조회 3,637
11-10-21 조회 2,449
11-10-21 조회 2,351
11-10-19 조회 2,401
11-10-19 조회 3,897
11-10-08 조회 2,456
11-10-06 조회 4,136
11-10-01 조회 2,428
11-09-30 조회 2,537
11-09-29 조회 2,539
11-09-26 조회 2,392
11-09-23 조회 2,393
11-09-23 조회 2,169
11-09-22 조회 2,755
11-09-09 조회 3,034
11-08-30 조회 3,920
11-08-23 조회 2,170
11-08-12 조회 2,354
11-08-04 조회 3,943
11-07-01 조회 2,912
11-06-09 조회 2,553
11-05-17 조회 2,607
11-05-07 조회 2,936
11-04-21 조회 2,600
11-04-12 조회 2,435
11-04-11 조회 3,565
11-02-11 조회 2,690
11-02-08 조회 2,103
11-01-11 조회 2,521
10-11-26 조회 3,851