숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4070
-- 카테고리 테이블을 작성한다.
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-08-29 조회 3,881
12-08-07 조회 3,561
12-08-03 조회 3,495
12-07-31 조회 3,609
12-07-30 조회 3,569
12-07-16 조회 3,770
12-07-15 조회 3,465
12-07-07 조회 3,465
12-07-06 조회 3,559
12-07-03 조회 3,625
12-06-29 조회 3,213
12-06-22 조회 3,578
12-06-17 조회 3,686
12-05-21 조회 3,762
12-05-02 조회 3,352
12-05-02 조회 4,139
12-05-02 조회 3,255
12-04-30 조회 3,394
12-04-30 조회 3,107
12-03-17 조회 3,911
12-03-10 조회 3,330
12-03-08 조회 3,743
12-03-03 조회 3,508
12-02-27 조회 4,917
12-02-17 조회 4,266
12-02-16 조회 4,411
12-02-03 조회 3,258
12-01-31 조회 2,996
12-01-24 조회 3,071
12-01-17 조회 3,823
12-01-05 조회 3,381
11-12-30 조회 2,993
11-12-23 조회 4,593
11-12-08 조회 3,351
11-12-07 조회 4,327
11-11-27 조회 3,763
11-11-25 조회 4,077
11-11-23 조회 3,471
11-11-22 조회 3,401
11-11-09 조회 3,171
11-10-23 조회 3,071
11-10-19 조회 3,049
11-10-08 조회 2,755
11-10-04 조회 2,772
11-10-04 조회 5,213
11-09-01 조회 4,270
11-08-13 조회 2,445
11-08-06 조회 3,132
11-07-11 조회 3,533
11-06-27 조회 2,901
11-06-21 조회 2,521
11-06-13 조회 2,352
11-06-07 조회 2,343
11-05-26 조회 2,343
11-04-20 조회 2,671
11-03-21 조회 2,763
11-03-18 조회 2,459
11-03-11 조회 2,489
11-02-07 조회 2,312
11-01-18 조회 2,638
11-01-12 조회 2,359
11-01-06 조회 2,475
10-12-10 조회 2,738
10-12-09 조회 2,390
10-12-08 조회 4,989
10-11-29 조회 2,479
10-11-28 조회 2,717
10-11-28 조회 2,551
10-11-19 조회 2,750
10-11-04 조회 2,675
10-10-21 조회 2,382
10-10-19 조회 3,333
10-10-12 조회 2,657
10-10-07 조회 2,451
10-09-30 조회 3,442
10-09-17 조회 3,839
10-09-17 조회 3,798
10-05-31 조회 3,469
09-12-31 조회 3,607
09-07-23 조회 4,901
08-09-16 조회 3,167
08-09-06 조회 2,886
08-09-04 조회 3,319
08-08-16 조회 4,367
08-08-15 조회 3,248
08-08-14 조회 4,455
08-08-12 조회 3,812
08-07-23 조회 2,742
08-07-10 조회 3,678
08-07-04 조회 2,909
08-06-27 조회 7,564
08-06-19 조회 4,852
08-05-27 조회 5,465
08-05-25 조회 5,290
08-05-23 조회 3,362
08-05-23 조회 4,497
08-05-21 조회 4,882
08-05-20 조회 4,009
08-05-20 조회 3,247
08-04-18 조회 4,276