NoSQL MongoDB 설치

1.mongoDB 다운로드 링크

https://www.mongodb.com/download-center#community

2. 윈도우에서 설치

Next->동의->Complete->Next

MongoDB compass 체크 해제 (오류 검사 기능)->next->install -> finish

3.Windows에서 mongoDB 실행

윈도우의 C드라이브에 설치 한 경로로 이동

mongoDB 실행문 : mongod.exe --dbpath D:\test\mongodb

실행확인 : waiting for connection on port 27017

CMD 새 창 실행

명령문

db 확인 명령어 : db

db status 확인 명령어 : db.stats()

몽고DB 종료 명령어 : Ctrl C

-------------------------------------

4.linux에서 mongoDB 실행

-----

4-1. 압축해제

-----

4-2. 압축파일을 /usr/local/mongodb로 이동

-----

4-3. 워크스페이스 만들기 : mkdir mongo_data

-----

4-4. 환경설정 : vi /etc/profile

-----

4-5. 환경설정 실행 한 후 cd mongodb bin으로 이동

-----

4-6.mongoDB 실행하기

-----

4-7 mongoDB 실행 확인

설치 끝!

이 블로그의 인기 게시물

[DATA STRUCTURE] 큐 QUEUE

큐[QUEUE]의개념 Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first. First In First Out Basic Operation Queue operations may involve initializing or defining the queue, utilizing it, and then completely erasing it from the memory. Here we shall try to understand the basic operations associated with queues − enqueue() − add (store) an item to the queue. dequeue() − remove (access) an item from the queue. Few more functions are required to make the above-mentioned queue operation efficient. These are − peek() − Gets the element at the front of the queue without removing it. isfull() − Checks if the queue is full.[Boolean] isempty() − Checks if the queue is empty.[Boolean] 큐의사용 예 너비 우선 탐색(BFS, Breadth-First Search) 구현 처리해야 할 노...

자세한 내용 보기

[DATA STRUCTURE] HEAP

What is Binary Heap ? Let us first define a Complete Binary Tree. A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible (Source Wikipedia ) A Binary Heap is a Complete Binary Tree where items are stored in a special order such that value in a parent node is greater(or smaller) than the values in its two children nodes. The former is called as max heap and the latter is called min heap. The heap can be represented by binary tree or array. Why array based representation for Binary Heap? Since a Binary Heap is a Complete Binary Tree, it can be easily represented as array and array based representation is space efficient. If the parent node is stored at index I, the left child can be calculated by 2 * I + 1 and right child by 2 * I + 2 (assuming the indexing starts at 0). public class HeapSort { void sort ( int [] ...

자세한 내용 보기

SSH 공개키 암호화 설정

★서버명은 임의 공개키 암호화 방식 -[bigdata01,02,03,04]에 동시에 만듬 1.ssh key 만들기 [ ssh-keygen -t rsa ] 2. 아래와 같이 key 생성여부 확인 3. [ cat id_rsa.pub >> authorized_keys ] authorized_keys폴더에 key 암호를 복사 4.폴더 확인 id_rsa [private] 와 id_rsa.pub [public] 이 만들어짐 5 cat authorized_keys 로 검색하면 아래와 같이 암호가 만든 폴더로 들어감. 6.bigdata01에 [ ssh root@bigdata02 cat ~/.ssh/id_rsa.pub >> ~/.ssh/authorized_keys ] 를 입력 7.최종적으로 bigdata 02,03,04를 6번 같이 입력하여 authorized_keys 폴더 에 전부 넣음 8. [ scp -rp authorized_keys root@bigdata02:~/.ssh/authorized_keys ] ★scp= secure copy bigdata 02, 03, 04 설정한 것을 복사해서 보냄. 9. bidata01에서 [ ssh bigdata02 date ] 코드를 쳐서 아래와 같이 나오면 성공

자세한 내용 보기

배움을 기록으로

이 블로그 검색