숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4095
-- 카테고리 테이블을 작성한다.
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-10 조회 3,837
12-04-06 조회 5,286
12-04-06 조회 3,063
12-04-04 조회 4,155
12-04-02 조회 3,484
12-03-30 조회 3,415
12-03-29 조회 5,958
12-03-28 조회 3,315
12-03-28 조회 4,221
12-03-27 조회 4,503
12-03-23 조회 3,711
12-03-21 조회 3,435
12-03-20 조회 3,233
12-03-18 조회 3,072
12-03-15 조회 3,256
12-03-12 조회 3,300
12-03-12 조회 3,251
12-03-08 조회 3,583
12-03-03 조회 3,651
12-03-03 조회 3,209
12-02-29 조회 3,476
12-02-28 조회 3,502
12-02-28 조회 3,324
12-02-28 조회 3,432
12-02-27 조회 3,851
12-02-27 조회 3,288
12-02-24 조회 3,444
12-02-24 조회 3,296
12-02-23 조회 3,646
12-02-20 조회 3,567
12-02-20 조회 4,033
12-02-17 조회 4,020
12-02-16 조회 3,163
12-02-15 조회 3,438
12-02-15 조회 3,526
12-02-14 조회 3,485
12-02-08 조회 3,438
12-02-06 조회 3,421
12-02-06 조회 3,845
12-01-25 조회 4,088
12-01-21 조회 3,989
12-01-20 조회 6,109
12-01-15 조회 3,606
12-01-15 조회 3,563
12-01-14 조회 3,460
12-01-14 조회 3,604
12-01-14 조회 3,328
12-01-12 조회 3,957
12-01-12 조회 4,212
12-01-10 조회 3,537
12-01-10 조회 4,337
12-01-09 조회 3,702
12-01-08 조회 6,965
12-01-08 조회 3,174
12-01-07 조회 3,525
12-01-06 조회 3,535
12-01-04 조회 3,678
12-01-03 조회 3,530
12-01-02 조회 3,932
12-01-02 조회 3,125
12-01-01 조회 4,057
12-01-01 조회 3,399
11-12-31 조회 3,647
11-12-31 조회 3,755
11-12-31 조회 3,584
11-12-30 조회 3,814
11-12-30 조회 4,997
11-12-30 조회 4,111
11-12-30 조회 4,263
11-12-30 조회 3,740
11-12-30 조회 3,462
11-12-30 조회 3,473
11-12-29 조회 3,188
11-12-22 조회 3,413
11-12-21 조회 3,325
11-12-20 조회 3,604
11-12-15 조회 5,404
11-12-15 조회 4,402
11-12-14 조회 5,431
11-12-12 조회 3,627
11-12-03 조회 3,382
11-11-26 조회 3,444
11-11-19 조회 3,689
11-11-01 조회 3,015
11-10-23 조회 2,684
11-10-21 조회 2,662
11-10-15 조회 3,128
11-10-15 조회 2,861
11-10-15 조회 3,532
11-10-15 조회 2,763
11-10-14 조회 2,797
11-10-13 조회 2,569
11-10-11 조회 2,814
11-10-10 조회 2,636
11-09-30 조회 3,515
11-09-30 조회 2,949
11-09-29 조회 4,781
11-09-29 조회 2,617
11-09-23 조회 2,649
11-09-16 조회 2,974