숀패밀리

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

· 2011-12-17 (토) 11:20:05 · 4205
-- 카테고리 테이블을 작성한다.
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-26 조회 3,830
12-04-24 조회 3,226
12-04-23 조회 4,558
12-04-22 조회 3,251
12-04-19 조회 3,335
12-04-18 조회 4,387
12-04-18 조회 3,098
12-04-17 조회 3,371
12-04-17 조회 5,130
12-04-16 조회 3,548
12-04-13 조회 3,089
12-04-09 조회 3,161
12-04-04 조회 3,933
12-04-01 조회 3,211
12-03-31 조회 3,602
12-03-30 조회 3,212
12-03-30 조회 3,873
12-03-26 조회 3,482
12-03-26 조회 3,064
12-03-22 조회 3,216
12-03-21 조회 3,072
12-03-19 조회 3,481
12-03-17 조회 3,510
12-03-14 조회 3,239
12-03-10 조회 3,922
12-03-09 조회 3,501
12-03-09 조회 3,327
12-03-08 조회 3,801
12-03-08 조회 3,972
12-03-08 조회 4,065
12-03-03 조회 3,314
12-03-02 조회 4,639
12-02-28 조회 3,174
12-02-27 조회 2,987
12-02-25 조회 3,130
12-02-24 조회 3,840
12-02-23 조회 3,107
12-02-22 조회 3,628
12-02-22 조회 5,397
12-02-22 조회 3,970
12-02-22 조회 4,290
12-02-18 조회 3,781
12-02-17 조회 3,001
12-02-17 조회 3,409
12-02-14 조회 3,484
12-02-13 조회 3,365
12-02-10 조회 1만
12-02-08 조회 3,023
12-02-07 조회 3,363
12-02-06 조회 3,088
12-02-05 조회 3,553
12-01-31 조회 3,481
12-01-30 조회 9,664
12-01-29 조회 3,821
12-01-26 조회 3,420
12-01-25 조회 4,033
12-01-24 조회 3,427
12-01-10 조회 3,739
12-01-10 조회 4,497
12-01-09 조회 3,272
12-01-08 조회 7,135
12-01-08 조회 3,657
12-01-07 조회 5,191
12-01-04 조회 3,888
12-01-02 조회 3,114
12-01-02 조회 3,168
12-01-02 조회 3,474
12-01-01 조회 3,107
11-12-31 조회 3,416
11-12-31 조회 3,094
11-12-30 조회 3,259
11-12-30 조회 3,412
11-12-29 조회 3,626
11-12-28 조회 3,718
11-12-26 조회 3,292
11-12-23 조회 3,507
11-12-22 조회 3,051
11-12-15 조회 4,142
11-12-08 조회 3,959
11-12-05 조회 3,298
11-12-04 조회 5,714
11-12-03 조회 3,574
11-12-02 조회 3,355
11-12-01 조회 5,430
11-11-30 조회 2,914
11-11-30 조회 2,815
11-11-28 조회 3,159
11-11-26 조회 3,339
11-11-25 조회 3,359
11-11-24 조회 2,955
11-11-22 조회 3,046
11-11-22 조회 2,888
11-11-17 조회 2,823
11-11-11 조회 2,821
11-11-09 조회 2,877
11-11-08 조회 3,255
11-11-08 조회 2,546
11-11-04 조회 3,627
11-11-01 조회 2,935
11-10-26 조회 2,521