[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_36a8c5f5-2c16-4e31-b49f-846f2fb16f36":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:36a8c5f5-2c16-4e31-b49f-846f2fb16f36,\"}":761},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":675,"manageAffiliations":684,"indexDatabases":705,"url":744,"thumbnailPath":26,"statistic":745,"gsStatistic":26,"type":26,"analyzePriority":26},"36a8c5f5-2c16-4e31-b49f-846f2fb16f36","2023-05-29T10:29:15.715+00:00","2025-11-21T10:04:17.959+00:00",[],"ACM-Transactions-on-Database-Systems",{"country":665,"issn":667,"introduce":669,"eissn":671,"title":673},{"VOID":666},"US",{"VOID":668},"15574644",{"EN":670},"Heavily used in both academic and corporate R&D settings, ACM Transactions on Database Systems (TODS) is a key publication for computer scientists working in data abstraction, data modeling, and designing data management systems. Topics include storage and retrieval, transaction management, distributed and federated databases, semantics of data, intelligent databases, and operations and algorithms relating to these areas. In this rapidly changing field, TODS provides insights into the thoughts of the best minds in database R&D.",{"VOID":672},"03625915",{"EN":674},"ACM Transactions on Database Systems",[676],{"id":677,"createTime":678,"updateTime":679,"relativeEntities":680,"label":681,"description":683,"parentId":26,"standard":26,"scholarHubFieldId":26},"c41bb0c4-b86d-4bd6-ac06-d1efed5edcce","2023-05-29T10:24:12.280+00:00","2023-11-21T07:21:58.105+00:00",[],{"EN":682},"Information Systems",{},[685,695],{"id":686,"createTime":687,"updateTime":688,"relativeEntities":689,"slug":690,"properties":691,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":694,"statistic":26},"e413bfb3-d7e1-44b7-91f5-e2c2169ea732","2023-05-29T12:06:10.964+00:00","2024-02-11T02:11:46.468+00:00",[],"ASSOC-COMPUTING-MACHINERY",{"title":692},{"EN":693},"ASSOC COMPUTING MACHINERY",[],{"id":696,"createTime":697,"updateTime":698,"relativeEntities":699,"slug":700,"properties":701,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":704,"statistic":26},"3e1064b5-61a8-4ca3-bf0f-108007c66507","2023-05-29T10:24:25.162+00:00","2025-11-21T10:07:07.489+00:00",[],"Association-for-Computing-Machinery-ACM-",{"title":702},{"EN":703},"Association for Computing Machinery (ACM)",[],[706,725],{"id":707,"indexDatabase":708,"url":720,"indexYears":721,"academicFieldIds":722,"indexDatabaseRanking":724},"acc43384-bcf6-4fa7-a8c1-79f82593039c",{"id":709,"createTime":710,"updateTime":711,"relativeEntities":712,"label":713,"description":715,"key":717,"publicationTags":718,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":714,"VI":714},"Scopus - Elsevier",{"EN":714,"VI":716},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[719],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F13044","1976-2024",[723],"499fd762-4414-45c1-b2b3-cc8d2abe204b","SCOPUS__Q1",{"id":726,"indexDatabase":727,"url":741,"indexYears":26,"academicFieldIds":742,"indexDatabaseRanking":26},"07b1acf8-9648-4f1b-997a-707176ad0897",{"id":728,"createTime":729,"updateTime":730,"relativeEntities":731,"label":732,"description":734,"key":737,"publicationTags":738,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":733,"VI":733},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":735,"EN":736},"Cơ sở dữ liệu SCIE","SCIE database","scie",[739,740],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0362-5915",[743],"213b6fd5-fb87-42bb-b348-eda0690eebc4","https:\u002F\u002Fdl.acm.org\u002Fjournal\u002Ftods",{"impactFactor":36,"impactFactorByYear":746,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":747,"totalCitation":748,"totalCitationByYear":749,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":757,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},7224,{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},4815,485,448,439,462,202,555.69,{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},2407.5,224,39.67,{"meta":762,"data":764},{"total":763},"24",[765,953,1168,1299,1608,1767,2005,2182,2331,2465],{"id":766,"createTime":767,"updateTime":767,"relativeEntities":768,"slug":769,"properties":770,"entityType":782,"verifyStatus":25,"verifyTime":783,"verifyNote":784,"syncStatus":28,"languages":785,"translateLanguages":26,"viewCount":36,"primaryUrl":786,"fullTextUrl":26,"authors":787,"publicationType":808,"publisherRelationship":809,"citationCount":846,"citationInfo":847,"publishDate":854,"publishYear":855,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":856,"isForceReanalyzing":952},"80d695db-f0e5-4ed1-a838-ee936eefa126","2024-09-22T09:51:20.209+00:00",[],"The-entity-relationship-model-toward-a-unified-view-of-data",{"mag":771,"keywords":773,"openalex":774,"abstract":776,"title":778,"doi":780},{"VOID":772},"2945526390",{},{"VOID":775},"W2945526390",{"EN":777},"\u003Cjats:p>A data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and the diagrammatic technique is given. Some implications for data integrity, information retrieval, and data manipulation are discussed.\u003C\u002Fjats:p>\n          \u003Cjats:p>The entity-relationship model can be used as a basis for unification of different views of data: the network model, the relational model, and the entity set model. Semantic ambiguities in these models are analyzed. Possible ways to derive their views of data from the entity-relationship model are presented.\u003C\u002Fjats:p>",{"EN":779},"The entity-relationship model—toward a unified view of data",{"VOID":781},"10.1145\u002F320434.320440","PUBLICATION","2024-09-22T09:51:20.208+00:00","Auto Verify",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F320434.320440",[788],{"id":789,"sortIndex":36,"researcher":26,"roles":790,"affiliations":791,"properties":803},"694d1b47-3db7-4170-823b-99ddbbe446c5",[],[792],{"id":793,"sortIndex":36,"affiliation":794,"properties":26},"18b372b0-3088-4ea5-b695-f5b4a59d859b",{"id":795,"createTime":796,"updateTime":797,"relativeEntities":798,"slug":799,"properties":800,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"6c2b85df-e9b8-4438-9cb8-e76b931bd384","2023-12-06T02:24:38.592+00:00","2025-02-09T23:40:59.267+00:00",[],"Massachusetts-Institute-of-Technology-Cambridge",{"title":801},{"VI":802},"Massachusetts Institute of Technology, Cambridge",{"openalex":804,"title":806},{"VOID":805},"A5066708902",{"EN":807},"Peter Pin-Shan Chen","ARTICLE",{"url":26,"publisher":810,"properties":840},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":811,"slug":663,"properties":812,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":818,"manageAffiliations":819,"indexDatabases":820,"url":744,"thumbnailPath":26,"statistic":835,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":813,"issn":814,"introduce":815,"eissn":816,"title":817},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[821,828],{"id":726,"indexDatabase":822,"url":741,"indexYears":26,"academicFieldIds":827,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":823,"label":824,"description":825,"key":737,"publicationTags":826,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":829,"url":720,"indexYears":721,"academicFieldIds":834,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":830,"label":831,"description":832,"key":717,"publicationTags":833,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":836,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":837,"totalCitation":748,"totalCitationByYear":838,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":839,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":841,"pages":843,"issue":845},{"VOID":842},"1",{"VOID":844},"9-36",{"VOID":842},4428,{"total":846,"publishYear":26,"statisticByYear":848},{"2012":849,"2013":850,"2014":851,"2015":652,"2016":258,"2017":353,"2018":852,"2019":853,"2020":250,"2021":348,"2022":251,"2023":253,"2024":168},140,105,98,99,87,"1976-03-01",1976,[857,860,863,866,869,872,875,878,881,884,887,890,893,896,900,903,907,910,913,916,919,922,925,928,931,934,937,940,943,946,949],{"id":26,"text":858,"url":26,"identifiers":859},",~k BRIAL , J.R. Data semantics. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds ., North-Holland Pub. Co. , Amsterdam , 1974 , pp. 1 - 60 . ,~kBRIAL, J.R. Data semantics. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds., North-Holland Pub. Co., Amsterdam, 1974, pp. 1-60.",{},{"id":26,"text":861,"url":26,"identifiers":862},"BACHMAN , C.W. Software for random access processing. Datamation I1 ( April 1965 ), 36 - 41 . BACHMAN, C.W. Software for random access processing. Datamation I1 (April 1965), 36-41.",{},{"id":26,"text":864,"url":26,"identifiers":865},"10.1145\u002F1017466.1017467",{"doi":864},{"id":26,"text":867,"url":26,"identifiers":868},"BACHMAN , C.W. Trends in database management--1975 . Proc., AFIPS 1975 NCC , Vol. 44 , AFIPS Press, Montvale, N.J. , pp. 569 - 576 . BACHMAN, C.W. Trends in database management--1975. Proc., AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 569-576.",{},{"id":26,"text":870,"url":26,"identifiers":871},"BIRKHOFF , ~., AND BARTEE , T.C. Modern Applied Algebra . McGraw-Hill , New York , 1970 . BIRKHOFF, ~., AND BARTEE, T.C. Modern Applied Algebra. McGraw-Hill, New York, 1970.",{},{"id":26,"text":873,"url":26,"identifiers":874},"10.1145\u002F800296.811515",{"doi":873},{"id":26,"text":876,"url":26,"identifiers":877},"CODASYL. Data base task group report . ACM , New York , 1971 . CODASYL. Data base task group report. ACM, New York, 1971.",{},{"id":26,"text":879,"url":26,"identifiers":880},"10.1145\u002F362384.362685",{"doi":879},{"id":26,"text":882,"url":26,"identifiers":883},"10.1145\u002F1734714.1734716",{"doi":882},{"id":26,"text":885,"url":26,"identifiers":886},"10.1145\u002F1734714.1734718",{"doi":885},{"id":26,"text":888,"url":26,"identifiers":889},"CODD , E.F. Recent investigations in relational data base systems . Proc. IFIP Congress 1974 , North-Holland Pub. Co., Amsterdam , pp. 1017 - 1021 . CODD, E.F. Recent investigations in relational data base systems. Proc. IFIP Congress 1974, North-Holland Pub. Co., Amsterdam, pp. 1017-1021.",{},{"id":26,"text":891,"url":26,"identifiers":892},"DEHENEFFE , C. , HENNEBERT , H. , AND PAULUS , W. Relational model for data base . Proc. IFIP Congress 1974 , North-Holland Pub. Co., Amsterdam , pp. 1022 - 1025 . DEHENEFFE, C., HENNEBERT, H., AND PAULUS, W. Relational model for data base. Proc. IFIP Congress 1974, North-Holland Pub. Co., Amsterdam, pp. 1022-1025.",{},{"id":26,"text":894,"url":26,"identifiers":895},"DODD , G.G. APL--a language for associate data handling in PL\u002FI . Proc. AFIPS 1966 FJCC , Vol. 29 , Spartan Books, New York , pp. 677 - 084 . DODD, G.G. APL--a language for associate data handling in PL\u002FI. Proc. AFIPS 1966 FJCC, Vol. 29, Spartan Books, New York, pp. 677-084.",{},{"id":26,"text":897,"url":26,"identifiers":898},"ESWXRAN , K.P. , AND CHAMBERLI~ , D.D. Functional specifications of a subsystem for data base integrity . Proc. Very Large Data Base Conf., Framingham, Mass. , Sept. 1975 , pp. 48 - 68 . ESWXRAN, K.P., AND CHAMBERLI~, D.D. Functional specifications of a subsystem for data base integrity. Proc. Very Large Data Base Conf., Framingham, Mass., Sept. 1975, pp. 48-68.",{"doi":899},"10.1145\u002F1282480.1282484",{"id":26,"text":901,"url":26,"identifiers":902},"HAINAUT , J.L. , AND LECHARLXER , B. An extensible semantic model of data base and its data language . Proc. IFIP Congress 1974 , North-Holland Pub. Co., Amsterdam , pp. 1026 - 1030 . HAINAUT, J.L., AND LECHARLXER, B. An extensible semantic model of data base and its data language. Proc. IFIP Congress 1974, North-Holland Pub. Co., Amsterdam, pp. 1026- 1030.",{},{"id":26,"text":904,"url":26,"identifiers":905},"HAMMER , M.M. , AND McLzo D, D . J. Semantic integrity in a relation data base system . Proc. Very Large Data Base Conf., Framingham, Mass. , Sept. 1975 , pp. 25 -- 47 . HAMMER, M.M., AND McLzoD, D.J. Semantic integrity in a relation data base system. Proc. Very Large Data Base Conf., Framingham, Mass., Sept. 1975, pp. 25--47.",{"doi":906},"10.1145\u002F1282480.1282483",{"id":26,"text":908,"url":26,"identifiers":909},"LI~DG~EEN , Po Basic operations on information as a basis for data base design . Proc. IFIP Congress 1974 , North-Holland Pub. Co., Amsterdam , pp. 993 - 997 . LI~DG~EEN, Po Basic operations on information as a basis for data base design. Proc. IFIP Congress 1974, North-Holland Pub. Co., Amsterdam, pp. 993-997.",{},{"id":26,"text":911,"url":26,"identifiers":912},"MEALY , G.H. Another look at data base . Proc. AFIPS 1967 FJCC , Vol. 31 , AFIPS Press, Montvale, N.J. , pp. 525 - 534 . MEALY, G.H. Another look at data base. Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, Montvale, N.J., pp. 525-534.",{},{"id":26,"text":914,"url":26,"identifiers":915},"~IJSSEN , G.M. Data structuring in the DDL and the relational model. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds ., North-Holland Pub. Co. , Amsterdam , 1974 , pp. 363 - 379 . ~IJSSEN, G.M. Data structuring in the DDL and the relational model. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds., North-Holland Pub. Co., Amsterdam, 1974, pp. 363-379.",{},{"id":26,"text":917,"url":26,"identifiers":918},"OLLE , T.W. Current and future trends in data base management systems . Proc. IFIP Congress 1974 , North-Holland Pub. Co., Amsterdam , pp. 998 - 1006 . OLLE, T.W. Current and future trends in data base management systems. Proc. IFIP Congress 1974, North-Holland Pub. Co., Amsterdam, pp. 998-1006.",{},{"id":26,"text":920,"url":26,"identifiers":921},"10.1145\u002F1282480.1282490",{"doi":920},{"id":26,"text":923,"url":26,"identifiers":924},"RUSTIC , R. (Ed.). Proc. ACM-SOGMOD 1974~debate on data models . Ann Arbor, Mich. , May 1974 . RUSTIC, R. (Ed.). Proc. ACM-SOGMOD 1974~debate on data models. Ann Arbor, Mich., May 1974.",{},{"id":26,"text":926,"url":26,"identifiers":927},"10.1145\u002F500080.500110",{"doi":926},{"id":26,"text":929,"url":26,"identifiers":930},"SENXO , M.E. Data description language in the concept of multilevel structured description: DIAM II with FORAL. In Data Base Description, B.C.M. Dougue, and G.M. Ni}ssen, Eds ., North-Holland Pub. Co. , Amsterdam , pp. 239 - 258 . SENXO, M.E. Data description language in the concept of multilevel structured description: DIAM II with FORAL. In Data Base Description, B.C.M. Dougue, and G.M. Ni}ssen, Eds., North-Holland Pub. Co., Amsterdam, pp. 239-258.",{},{"id":26,"text":932,"url":26,"identifiers":933},"10.1147\u002Fsj.121.0030",{"doi":932},{"id":26,"text":935,"url":26,"identifiers":936},"10.1145\u002F800297.811530",{"doi":935},{"id":26,"text":938,"url":26,"identifiers":939},"10.1145\u002F500080.500101",{"doi":938},{"id":26,"text":941,"url":26,"identifiers":942},"10.1145\u002F500080.500091",{"doi":941},{"id":26,"text":944,"url":26,"identifiers":945},"SUNDGREN , B. Conceptual foundation of the infological approach to data bases. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds ., North-Holland Pub. Co. , Amsterdam , 1974 , pp. 61 - 95 . SUNDGREN, B. Conceptual foundation of the infological approach to data bases. In Data Base Management, J.W. Klimbie and K.L. Koffeman, Eds., North-Holland Pub. Co., Amsterdam, 1974, pp. 61-95.",{},{"id":26,"text":947,"url":26,"identifiers":948},"TAYLOR , R.W. Observations on the attributes of database sets. In Data Base Description, B.C.M. Dougue and G.M. Nijssen, Eds ., North-Holland Pub. Co. , Amsterdam , pp. 73 - 84 . TAYLOR, R.W. Observations on the attributes of database sets. In Data Base Description, B.C.M. Dougue and G.M. Nijssen, Eds., North-Holland Pub. Co., Amsterdam, pp. 73-84.",{},{"id":26,"text":950,"url":26,"identifiers":951},"TSICHRITZIS , D. A network framework for relation implementation. In Data Base Description, B.C.M. Douge and G.M. Nijssen, Eds ., North-Holland Pub. Co. , Amsterdam , pp. 269 - 282 . TSICHRITZIS, D. A network framework for relation implementation. In Data Base Description, B.C.M. Douge and G.M. Nijssen, Eds., North-Holland Pub. Co., Amsterdam, pp. 269-282.",{},false,{"id":954,"createTime":955,"updateTime":955,"relativeEntities":956,"slug":957,"properties":958,"entityType":782,"verifyStatus":25,"verifyTime":955,"verifyNote":784,"syncStatus":28,"languages":970,"translateLanguages":26,"viewCount":36,"primaryUrl":971,"fullTextUrl":26,"authors":972,"publicationType":808,"publisherRelationship":1027,"citationCount":1064,"citationInfo":1065,"publishDate":1067,"publishYear":1068,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1069,"isForceReanalyzing":952},"2e163538-7679-4448-b3ee-b455ec5e5246","2025-01-02T03:26:05.547+00:00",[],"The-Grid-File",{"mag":959,"keywords":961,"openalex":962,"abstract":964,"title":966,"doi":968},{"VOID":960},"2149173084",{},{"VOID":963},"W2149173084",{"EN":965},"\u003Cjats:p>\n            Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access. They manifest various deficiencies in particular for multikey access to highly dynamic files. We study the dynamic aspects of file structures that treat all keys symmetrically, that is, file structures which avoid the distinction between primary and secondary keys. We start from a bitmap approach and treat the problem of file design as one of data compression of a large sparse matrix. This leads to the notions of a\n            \u003Cjats:italic>grid partition\u003C\u002Fjats:italic>\n            of the search space and of a\n            \u003Cjats:italic>grid directory\u003C\u002Fjats:italic>\n            , which are the keys to a dynamic file structure called the\n            \u003Cjats:italic>grid file\u003C\u002Fjats:italic>\n            . This file system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper bound of two disk accesses for single record retrieval; it also handles range queries and partially specified queries efficiently. We discuss in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.\n          \u003C\u002Fjats:p>",{"EN":967},"The Grid File",{"VOID":969},"10.1145\u002F348.318586",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F348.318586",[973,992,1007],{"id":974,"sortIndex":115,"researcher":26,"roles":975,"affiliations":976,"properties":987},"59a84979-ff27-4a57-a683-0e98e3826fc8",[],[977],{"id":978,"sortIndex":36,"affiliation":979,"properties":26},"303df7d4-3826-4285-a3bd-039a7fd87f83",{"id":980,"createTime":981,"updateTime":981,"relativeEntities":982,"slug":983,"properties":984,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"86b87ba0-237c-4bae-8fce-472707ec77a2","2025-01-02T03:26:05.552+00:00",[],"Institut-f%C3%BCr-Informatik-ETH",{"title":985},{"EN":986},"Institut für Informatik, ETH",{"openalex":988,"title":990},{"VOID":989},"A5078362910",{"EN":991},"Hans Hinterberger",{"id":993,"sortIndex":36,"researcher":26,"roles":994,"affiliations":995,"properties":1002},"afef0d8c-ac5e-4ebb-9fe3-f65fd19fc59d",[],[996],{"id":997,"sortIndex":36,"affiliation":998,"properties":26},"a1507507-fa1d-4c09-a6c2-ef2efe419993",{"id":980,"createTime":981,"updateTime":981,"relativeEntities":999,"slug":983,"properties":1000,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1001},{"EN":986},{"openalex":1003,"title":1005},{"VOID":1004},"A5112628541",{"EN":1006},"J. Nievergelt",{"id":1008,"sortIndex":114,"researcher":26,"roles":1009,"affiliations":1010,"properties":1022},"ecd9ec6a-121d-4a9b-813d-8d37cedc1e86",[],[1011],{"id":1012,"sortIndex":36,"affiliation":1013,"properties":26},"fa68fc38-1877-458b-b2aa-60b64ebb91c5",{"id":1014,"createTime":1015,"updateTime":1016,"relativeEntities":1017,"slug":1018,"properties":1019,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"47eb5d6e-90c9-4f72-9394-e914bbd774fc","2024-02-11T00:39:53.127+00:00","2025-02-11T08:10:55.018+00:00",[],"University-of-Toronto",{"title":1020},{"VI":1021},"University of Toronto",{"openalex":1023,"title":1025},{"VOID":1024},"A5110443998",{"EN":1026},"Kenneth C. Sevcik",{"url":26,"publisher":1028,"properties":1058},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1029,"slug":663,"properties":1030,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1036,"manageAffiliations":1037,"indexDatabases":1038,"url":744,"thumbnailPath":26,"statistic":1053,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1031,"issn":1032,"introduce":1033,"eissn":1034,"title":1035},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1039,1046],{"id":726,"indexDatabase":1040,"url":741,"indexYears":26,"academicFieldIds":1045,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1041,"label":1042,"description":1043,"key":737,"publicationTags":1044,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1047,"url":720,"indexYears":721,"academicFieldIds":1052,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1048,"label":1049,"description":1050,"key":717,"publicationTags":1051,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":1054,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":1055,"totalCitation":748,"totalCitationByYear":1056,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":1057,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":1059,"pages":1061,"issue":1063},{"VOID":1060},"9",{"VOID":1062},"38-71",{"VOID":842},1147,{"total":1064,"publishYear":26,"statisticByYear":1066},{"2012":51,"2013":241,"2014":238,"2015":222,"2016":173,"2017":239,"2018":242,"2019":336,"2020":124,"2021":298,"2022":52,"2023":53,"2024":115},"1984-03-23",1984,[1070,1073,1076,1079,1082,1085,1088,1092,1095,1098,1101,1104,1107,1110,1113,1116,1119,1122,1125,1128,1131,1134,1137,1140,1144,1147,1150,1153,1156,1159,1162,1165],{"id":26,"text":1071,"url":26,"identifiers":1072},"10.1145\u002F320107.320125",{"doi":1071},{"id":26,"text":1074,"url":26,"identifiers":1075},"10.1145\u002F361002.361007",{"doi":1074},{"id":26,"text":1077,"url":26,"identifiers":1078},"10.1109\u002FTSE.1979.234200",{"doi":1077},{"id":26,"text":1080,"url":26,"identifiers":1081},"10.1145\u002F588058.588070",{"doi":1080},{"id":26,"text":1083,"url":26,"identifiers":1084},"10.1145\u002F362342.362353",{"doi":1083},{"id":26,"text":1086,"url":26,"identifiers":1087},"10.1145\u002F320083.320092",{"doi":1086},{"id":26,"text":1089,"url":26,"identifiers":1090},"FINKEL R.A. AND BENTLEY J.L. Quad trees--a data structure for retrieval on composite keys. Acta Inf. 4 {1974) 1-9.  FINKEL R.A. AND BENTLEY J.L. Quad trees--a data structure for retrieval on composite keys. Acta Inf. 4 {1974) 1-9.",{"doi":1091},"10.1007\u002FBF00288933",{"id":26,"text":1093,"url":26,"identifiers":1094},"10.1145\u002F588111.588153",{"doi":1093},{"id":26,"text":1096,"url":26,"identifiers":1097},"GUETING , H. , AND KRIEGEL , H.P. Multidimensional B-tree : an efficient dynamic file structure for exact match queries. Forschungsbericht Nr. 105, Informatik, Univ. Dortmund , Dortmund , West Germany , 1980 . GUETING, H., AND KRIEGEL, H.P. Multidimensional B-tree: an efficient dynamic file structure for exact match queries. Forschungsbericht Nr. 105, Informatik, Univ. Dortmund, Dortmund, West Germany, 1980.",{},{"id":26,"text":1099,"url":26,"identifiers":1100},"H{ NRICHS , K. , AND NIEVERGELT , J. The grid file: a data structure designed to support proximity queries on spatial objects . In Proc. Workshop on Graph Theoretic Concepts in Computer Science (Osnabruck , 1983 ). H{NRICHS, K., AND NIEVERGELT, J. The grid file: a data structure designed to support proximity queries on spatial objects. In Proc. Workshop on Graph Theoretic Concepts in Computer Science (Osnabruck, 1983).",{},{"id":26,"text":1102,"url":26,"identifiers":1103},"H{ NTERBERGER , H. , AND NIEVERGELT , J. Concurrency control in two-level file structures. Working paper , Informatik , ETH Zurich , 1983 . H{NTERBERGER, H., AND NIEVERGELT, J. Concurrency control in two-level file structures. Working paper, Informatik, ETH Zurich, 1983.",{},{"id":26,"text":1105,"url":26,"identifiers":1106},"J0 SHI , S.M. , SANYAL , S. , BANERJEE , S. , AND SRIKUMAR , S. Using grid files for a relational database management system . Speech and Digital Systems Group , Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005, India. J0SHI, S.M., SANYAL, S., BANERJEE, S., AND SRIKUMAR, S. Using grid files for a relational database management system. Speech and Digital Systems Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005, India.",{},{"id":26,"text":1108,"url":26,"identifiers":1109},"KASHYAP , R.L. , SUBAS , S.K. C., AND YAO , S.B . Analysis of the multiattribute tree database organization . IEEE Trans. Softw. Eng. 2 , 6 ( Nov. 1977 ). KASHYAP, R.L., SUBAS, S.K.C., AND YAO, S.B. Analysis of the multiattribute tree database organization. IEEE Trans. Softw. Eng. 2, 6 (Nov. 1977).",{},{"id":26,"text":1111,"url":26,"identifiers":1112},"KNUTH , D.E. The Art of Computer Programming. Vo{. 3, Sorting and Searching . Addison- Wesley , Reading, Mass ., 1973 . KNUTH, D.E. The Art of Computer Programming. Vo{. 3, Sorting and Searching. Addison- Wesley, Reading, Mass., 1973.",{},{"id":26,"text":1114,"url":26,"identifiers":1115},"10.1145\u002F320613.320618",{"doi":1114},{"id":26,"text":1117,"url":26,"identifiers":1118},"L} TWXN , W. Linear hashing: a new tool for file and table addressing . In Proc. 6th international Conference on Very Large Data Bases , 1980 , pp. 212 - 223 . L}TWXN, W. Linear hashing: a new tool for file and table addressing. In Proc. 6th international Conference on Very Large Data Bases, 1980, pp. 212-223.",{},{"id":26,"text":1120,"url":26,"identifiers":1121},"10.1016\u002F0306-4379(77)90007-2",{"doi":1120},{"id":26,"text":1123,"url":26,"identifiers":1124},"10.1145\u002F362790.362794",{"doi":1123},{"id":26,"text":1126,"url":26,"identifiers":1127},"BARNES , M.C. , COLLENS , D.S. Storing hierarchic database structures in transposed form . Datafair , 1973 . BARNES, M.C., COLLENS, D.S. Storing hierarchic database structures in transposed form. Datafair, 1973.",{},{"id":26,"text":1129,"url":26,"identifiers":1130},"MERRETT , T.H. Multidimensional paging for efficient database querying . In Proc. ICMOD ( Milano, Italy , June 1978 ), pp. 277 - 289 . MERRETT, T.H. Multidimensional paging for efficient database querying. In Proc. ICMOD (Milano, Italy, June 1978), pp. 277-289.",{},{"id":26,"text":1132,"url":26,"identifiers":1133},"MERRETT , T.H. , AND OTOO , E.J. Dynamic multipaging: a storage structure for large shared data banks. Rep. SOCS-81-26 , McGill Univ. , 1981 . MERRETT, T.H., AND OTOO, E.J. Dynamic multipaging: a storage structure for large shared data banks. Rep. SOCS-81-26, McGill Univ., 1981.",{},{"id":26,"text":1135,"url":26,"identifiers":1136},"10.1145\u002F362919.362933",{"doi":1135},{"id":26,"text":1138,"url":26,"identifiers":1139},"NIEVERGELT , J. Trees as data and file structures . In CAAP '81, Proc. 6th Colloquium on Trees in Algebra and Programming , E. Astesiano and C. Bohm, Eds., Lecture Notes in Computer Science 112, Springer Verlag , 1981 , pp. 35 - 45 . NIEVERGELT, J. Trees as data and file structures. In CAAP '81, Proc. 6th Colloquium on Trees in Algebra and Programming, E. Astesiano and C. Bohm, Eds., Lecture Notes in Computer Science 112, Springer Verlag, 1981, pp. 35-45.",{},{"id":26,"text":1141,"url":26,"identifiers":1142},"NIEVERGELT , J. , HINTERBERGER , H. , AND SEVCIK , K.C. The grid file: an adaptable, symmetric multikey file structure . In Trends in Information Processing Systems, Proc. 3rd ECI Conference , A. Duijvestijn and P. Lockemann, Eds., Lecture Notes in Computer Science 123, Springer Verlag , 1981 , pp. 236 - 251 . NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K.C. The grid file: an adaptable, symmetric multikey file structure. In Trends in Information Processing Systems, Proc. 3rd ECI Conference, A. Duijvestijn and P. Lockemann, Eds., Lecture Notes in Computer Science 123, Springer Verlag, 1981, pp. 236-251.",{"doi":1143},"10.1007\u002F3-540-10885-8_45",{"id":26,"text":1145,"url":26,"identifiers":1146},"10.1016\u002F0020-0190(82)90027-8",{"doi":1145},{"id":26,"text":1148,"url":26,"identifiers":1149},"10.1145\u002F359007.359013",{"doi":1148},{"id":26,"text":1151,"url":26,"identifiers":1152},"10.1137\u002F0205003",{"doi":1151},{"id":26,"text":1154,"url":26,"identifiers":1155},"10.1145\u002F582318.582321",{"doi":1154},{"id":26,"text":1157,"url":26,"identifiers":1158},"10.1145\u002F360827.360831",{"doi":1157},{"id":26,"text":1160,"url":26,"identifiers":1161},"10.1016\u002F0306-4379(82)90024-2",{"doi":1160},{"id":26,"text":1163,"url":26,"identifiers":1164},"10.1007\u002FBF01934393",{"doi":1163},{"id":26,"text":1166,"url":26,"identifiers":1167},"10.1145\u002F942574.807128",{"doi":1166},{"id":1169,"createTime":1170,"updateTime":1170,"relativeEntities":1171,"slug":1172,"properties":1173,"entityType":782,"verifyStatus":25,"verifyTime":1170,"verifyNote":784,"syncStatus":28,"languages":1185,"translateLanguages":26,"viewCount":36,"primaryUrl":1186,"fullTextUrl":26,"authors":1187,"publicationType":808,"publisherRelationship":1207,"citationCount":1244,"citationInfo":1245,"publishDate":1247,"publishYear":1248,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1249,"isForceReanalyzing":952},"eb346317-fa02-49de-ace2-3a2c313bd80f","2024-10-15T03:57:00.067+00:00",[],"The-functional-data-model-and-the-data-languages-DAPLEX",{"mag":1174,"keywords":1176,"openalex":1177,"abstract":1179,"title":1181,"doi":1183},{"VOID":1175},"2147869465",{},{"VOID":1178},"W2147869465",{"EN":1180},"\u003Cjats:p>DAPLEX is a database language which incorporates:\u003C\u002Fjats:p>\n          \u003Cjats:p>This paper presents and motivates the DAPLEX language and the underlying data model on which it is based.\u003C\u002Fjats:p>",{"EN":1182},"The functional data model and the data languages DAPLEX",{"VOID":1184},"10.1145\u002F319540.319561",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F319540.319561",[1188],{"id":1189,"sortIndex":36,"researcher":26,"roles":1190,"affiliations":1191,"properties":1202},"2e467edd-9868-449d-9323-65b6761b7da6",[],[1192],{"id":1193,"sortIndex":36,"affiliation":1194,"properties":26},"d57d6166-cc3a-4be5-a763-0965850a9f75",{"id":1195,"createTime":1196,"updateTime":1196,"relativeEntities":1197,"slug":1198,"properties":1199,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"222abfa5-328a-44eb-9c8b-ce0ea88f4e9a","2024-10-15T03:57:00.082+00:00",[],"Computer-Corp-of-America",{"title":1200},{"EN":1201},"Computer Corp. of America",{"openalex":1203,"title":1205},{"VOID":1204},"A5005140357",{"EN":1206},"David W. Shipman",{"url":26,"publisher":1208,"properties":1238},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1209,"slug":663,"properties":1210,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1216,"manageAffiliations":1217,"indexDatabases":1218,"url":744,"thumbnailPath":26,"statistic":1233,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1211,"issn":1212,"introduce":1213,"eissn":1214,"title":1215},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1219,1226],{"id":726,"indexDatabase":1220,"url":741,"indexYears":26,"academicFieldIds":1225,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1221,"label":1222,"description":1223,"key":737,"publicationTags":1224,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1227,"url":720,"indexYears":721,"academicFieldIds":1232,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1228,"label":1229,"description":1230,"key":717,"publicationTags":1231,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":1234,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":1235,"totalCitation":748,"totalCitationByYear":1236,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":1237,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":1239,"pages":1241,"issue":1243},{"VOID":1240},"6",{"VOID":1242},"140-173",{"VOID":842},928,{"total":1244,"publishYear":26,"statisticByYear":1246},{"2012":114,"2013":59,"2014":115,"2015":115,"2016":162,"2017":52,"2018":158,"2019":115,"2020":59,"2021":115,"2022":114,"2023":115},"1981-03-01",1981,[1250,1253,1256,1259,1262,1265,1267,1269,1272,1275,1278,1281,1284,1287,1290,1293,1296],{"id":26,"text":1251,"url":26,"identifiers":1252},"SPECIAL ISSUE ON DATA-BASE MANAGEMENT SYSTEMS. ACM Comput. Surv. 8 , 1 ( March 1976 ), 1-I51. SPECIAL ISSUE ON DATA-BASE MANAGEMENT SYSTEMS. ACM Comput. Surv. 8, 1 (March 1976), 1-I51.",{},{"id":26,"text":1254,"url":26,"identifiers":1255},"10.1145\u002F320455.320457",{"doi":1254},{"id":26,"text":1257,"url":26,"identifiers":1258},"BACHMAN , C.W. , AND DAYA , M. The role concept in database models . Proc. Int. Conf. Very Large Databases , Tokyo, Japan , Oct. 1977 , pp. 464 - 476 . BACHMAN, C.W., AND DAYA, M. The role concept in database models. Proc. Int. Conf. Very Large Databases, Tokyo, Japan, Oct. 1977, pp. 464-476.",{},{"id":26,"text":1260,"url":26,"identifiers":1261},"10.1145\u002F359576.359579",{"doi":1260},{"id":26,"text":1263,"url":26,"identifiers":1264},"10.1145\u002F582095.582104",{"doi":1263},{"id":26,"text":781,"url":26,"identifiers":1266},{"doi":781},{"id":26,"text":879,"url":26,"identifiers":1268},{"doi":879},{"id":26,"text":1270,"url":26,"identifiers":1271},"DAYAL , U. , AND B~RNSTEIN , P.A. On the updatability of relational views . Proc. 4th Int. Conf. Very Large Databases , Berlin, West Germany , Sept. 1978 , pp. 368 - 377 . DAYAL, U., AND B~RNSTEIN, P.A. On the updatability of relational views. Proc. 4th Int. Conf. Very Large Databases, Berlin, West Germany, Sept. 1978, pp. 368-377.",{},{"id":26,"text":1273,"url":26,"identifiers":1274},"10.1145\u002F509252.509264",{"doi":1273},{"id":26,"text":1276,"url":26,"identifiers":1277},"KENT , W. Data and Reality . North-Holland , Amsterdam , 1978 . KENT, W. Data and Reality. North-Holland, Amsterdam, 1978.",{},{"id":26,"text":1279,"url":26,"identifiers":1280},"10.1145\u002F320064.320070",{"doi":1279},{"id":26,"text":1282,"url":26,"identifiers":1283},"QUILLIAN , H.R. Semantic memory . In Semantic Information Processing, M. Minsky, Ed. M.I.T. Press , Cambridge, Mass ., 1968 . QUILLIAN, H.R. Semantic memory. In Semantic Information Processing, M. Minsky, Ed. M.I.T. Press, Cambridge, Mass., 1968.",{},{"id":26,"text":1285,"url":26,"identifiers":1286},"10.1145\u002F582095.582107",{"doi":1285},{"id":26,"text":1288,"url":26,"identifiers":1289},"10.1145\u002F1499402.1499422",{"doi":1288},{"id":26,"text":1291,"url":26,"identifiers":1292},"10.1145\u002F320544.320546",{"doi":1291},{"id":26,"text":1294,"url":26,"identifiers":1295},"10.1145\u002F320473.320476",{"doi":1294},{"id":26,"text":1297,"url":26,"identifiers":1298},"10.1145\u002F359863.359883",{"doi":1297},{"id":1300,"createTime":1301,"updateTime":1301,"relativeEntities":1302,"slug":1303,"properties":1304,"entityType":782,"verifyStatus":25,"verifyTime":1301,"verifyNote":784,"syncStatus":28,"languages":1316,"translateLanguages":26,"viewCount":36,"primaryUrl":1317,"fullTextUrl":26,"authors":1318,"publicationType":808,"publisherRelationship":1453,"citationCount":1490,"citationInfo":1491,"publishDate":1493,"publishYear":1494,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1495,"isForceReanalyzing":952},"3026b3f7-15ce-435c-b0a4-ec1aee1e3eef","2024-09-27T18:45:43.700+00:00",[],"A-foundation-for-representing-and-querying-moving-objects",{"mag":1305,"keywords":1307,"openalex":1308,"abstract":1310,"title":1312,"doi":1314},{"VOID":1306},"2032521898",{},{"VOID":1309},"W2032521898",{"EN":1311},"\u003Cjats:p>\n            Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously that describe\n            \u003Cjats:italic>moving objects\u003C\u002Fjats:italic>\n            . Two fundamental abstractions are\n            \u003Cjats:italic>moving point\u003C\u002Fjats:italic>\n            and\n            \u003Cjats:italic>moving region\u003C\u002Fjats:italic>\n            , describing objects for which only the time-dependent position, or position and extent, respectively, are of interest. We propose to present such time-dependent geometries as attribute data types with suitable operations, that is, to provide an abstract data type extension to a DBMS data model and query language. This paper presents a design of such a system of abstract data types. It turns out that besides the main types of interest, moving point   and moving region, a relatively large number of auxiliary data types are needed. For example, one needs a line type to represent the projection of a moving point into the plane, or a “moving real” to represent the time-dependent distance of two points. It then becomes crucial to achieve (i) orthogonality in the design of the system, i.e., type constructors can be applied unifomly; (ii) genericity and consistency of operations, i.e., operations range over as many types as possible and behave consistently; and (iii) closure and consistency between structure and operations of nontemporal and related temporal types. Satisfying these goal leads to a simple and expressive system of abstract data types that may be integrated into a query language to yield a powerful language for   querying spatio-temporal data, including moving objects. The paper formally defines the types and operations, offers detailed insight into the considerations that went into the design, and exemplifies the use of the abstract data types using SQL. The paper offers a precise and conceptually clean foundation for implementing a spatio-temporal DBMS extension.\n          \u003C\u002Fjats:p>",{"EN":1313},"A foundation for representing and querying moving objects",{"VOID":1315},"10.1145\u002F352958.352963",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F352958.352963",[1319,1341,1360,1380,1397,1414,1436],{"id":1320,"sortIndex":115,"researcher":26,"roles":1321,"affiliations":1322,"properties":1334},"44ecf069-b4d9-450f-89c1-b99dfecd197d",[],[1323],{"id":1324,"sortIndex":36,"affiliation":1325,"properties":26},"7a086c3b-08ad-4dff-8641-66d570230cc3",{"id":1326,"createTime":1327,"updateTime":1328,"relativeEntities":1329,"slug":1330,"properties":1331,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"67f3390d-6591-4a69-87f6-7fc7660176fb","2024-01-17T07:07:45.301+00:00","2025-02-01T12:56:16.247+00:00",[],"Aalborg-University",{"title":1332},{"VI":1333},"Aalborg University",{"openalex":1335,"orcid":1337,"title":1339},{"VOID":1336},"A5017018305",{"VOID":1338},"https:\u002F\u002Forcid.org\u002F0000-0003-3694-9026",{"EN":1340},"Michael H. Böhlen",{"id":1342,"sortIndex":114,"researcher":26,"roles":1343,"affiliations":1344,"properties":1355},"8e2abf7e-3e04-4403-91af-114b2735b3f7",[],[1345],{"id":1346,"sortIndex":36,"affiliation":1347,"properties":26},"f2e203cc-3c8e-4a6c-ac4a-194dec0bba3c",{"id":1348,"createTime":1349,"updateTime":1349,"relativeEntities":1350,"slug":1351,"properties":1352,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ce6ef4c2-2a61-4be7-98dd-2cac65f2cb9f","2024-09-27T18:45:43.711+00:00",[],"FernUniv-Hagen-TAB-",{"title":1353},{"EN":1354},"FernUniv. Hagen#TAB#",{"openalex":1356,"title":1358},{"VOID":1357},"A5105469807",{"EN":1359},"Martin Erwig",{"id":1361,"sortIndex":111,"researcher":26,"roles":1362,"affiliations":1363,"properties":1375},"a861fde6-b559-4522-936a-916625e9149c",[],[1364],{"id":1365,"sortIndex":36,"affiliation":1366,"properties":26},"68645460-333b-4823-abaf-19646cfe822e",{"id":1367,"createTime":1368,"updateTime":1369,"relativeEntities":1370,"slug":1371,"properties":1372,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7407f1ac-f301-40eb-9f1a-a14ae610ef95","2024-04-21T19:16:23.386+00:00","2024-12-01T11:35:16.928+00:00",[],"Agricultural-University-of-Athens",{"title":1373},{"EN":1374},"Agricultural University of Athens",{"openalex":1376,"title":1378},{"VOID":1377},"A5016926199",{"EN":1379},"Nikos A. Lorentzos",{"id":1381,"sortIndex":59,"researcher":26,"roles":1382,"affiliations":1383,"properties":1390},"9409b3be-649a-46d4-bacf-759b43dfa45e",[],[1384],{"id":1385,"sortIndex":36,"affiliation":1386,"properties":26},"fd762fb9-5a50-4c11-9090-f05133a4404f",{"id":1326,"createTime":1327,"updateTime":1328,"relativeEntities":1387,"slug":1330,"properties":1388,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1389},{"VI":1333},{"openalex":1391,"orcid":1393,"title":1395},{"VOID":1392},"A5029380368",{"VOID":1394},"https:\u002F\u002Forcid.org\u002F0000-0002-9697-7670",{"EN":1396},"Christian S. Jensen",{"id":1398,"sortIndex":162,"researcher":26,"roles":1399,"affiliations":1400,"properties":1407},"3cf1e28d-1e2c-4741-85ed-62dbade19528",[],[1401],{"id":1402,"sortIndex":36,"affiliation":1403,"properties":26},"232a1ad0-d05e-4119-928e-66e93d21b2b6",{"id":1348,"createTime":1349,"updateTime":1349,"relativeEntities":1404,"slug":1351,"properties":1405,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1406},{"EN":1354},{"openalex":1408,"orcid":1410,"title":1412},{"VOID":1409},"A5101819568",{"VOID":1411},"https:\u002F\u002Forcid.org\u002F0000-0003-0543-2593",{"EN":1413},"Markus Schneider",{"id":1415,"sortIndex":135,"researcher":26,"roles":1416,"affiliations":1417,"properties":1429},"62cb9aa7-8a69-4f17-97b8-aff2b64acdef",[],[1418],{"id":1419,"sortIndex":36,"affiliation":1420,"properties":26},"f5b4b27a-fba6-450e-9f1d-e80f825c6411",{"id":1421,"createTime":1422,"updateTime":1423,"relativeEntities":1424,"slug":1425,"properties":1426,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"bc55139e-1419-43bc-9ad6-faf827ad66c6","2024-09-27T18:45:43.766+00:00","2024-11-27T18:30:43.282+00:00",[],"Athens-Univ-of-Economics-and-Business-TAB-",{"title":1427},{"EN":1428},"Athens Univ. of Economics and Business#TAB#",{"openalex":1430,"orcid":1432,"title":1434},{"VOID":1431},"A5057695979",{"VOID":1433},"https:\u002F\u002Forcid.org\u002F0000-0001-5923-4440",{"EN":1435},"Michalis Vazirgiannis",{"id":1437,"sortIndex":36,"researcher":26,"roles":1438,"affiliations":1439,"properties":1446},"db86b053-2e9b-469f-af69-299f2939675e",[],[1440],{"id":1441,"sortIndex":36,"affiliation":1442,"properties":26},"669ce308-2447-42a2-82d6-344f08a6f99d",{"id":1348,"createTime":1349,"updateTime":1349,"relativeEntities":1443,"slug":1351,"properties":1444,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1445},{"EN":1354},{"openalex":1447,"orcid":1449,"title":1451},{"VOID":1448},"A5055789823",{"VOID":1450},"https:\u002F\u002Forcid.org\u002F0000-0001-6260-4051",{"EN":1452},"Ralf Hartmut Güting",{"url":26,"publisher":1454,"properties":1484},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1455,"slug":663,"properties":1456,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1462,"manageAffiliations":1463,"indexDatabases":1464,"url":744,"thumbnailPath":26,"statistic":1479,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1457,"issn":1458,"introduce":1459,"eissn":1460,"title":1461},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1465,1472],{"id":726,"indexDatabase":1466,"url":741,"indexYears":26,"academicFieldIds":1471,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1467,"label":1468,"description":1469,"key":737,"publicationTags":1470,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1473,"url":720,"indexYears":721,"academicFieldIds":1478,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1474,"label":1475,"description":1476,"key":717,"publicationTags":1477,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":1480,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":1481,"totalCitation":748,"totalCitationByYear":1482,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":1483,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":1485,"pages":1487,"issue":1489},{"VOID":1486},"25",{"VOID":1488},"1-42",{"VOID":842},757,{"total":1490,"publishYear":26,"statisticByYear":1492},{"2012":252,"2013":255,"2014":517,"2015":124,"2016":255,"2017":260,"2018":173,"2019":336,"2020":53,"2021":50,"2022":158,"2023":111,"2024":115},"2000-03-01",2000,[1496,1499,1502,1505,1508,1511,1514,1517,1520,1523,1526,1529,1533,1536,1539,1542,1545,1549,1552,1555,1558,1561,1564,1567,1570,1573,1576,1579,1582,1585,1588,1591,1594,1597,1601,1604],{"id":26,"text":1497,"url":26,"identifiers":1498},"B HLEN , M. H. , JENSEN , C. S. , AND SKJELLAUG , B. 1998 . Spatio-temporal database support for legacy applications . In Proceedings of the 1998 ACM Symposium on Applied Computing ( Atlanta, GA, Feb.) , 226 - 234 . 10.1145\u002F330560.330675 B HLEN, M. H., JENSEN, C. S., AND SKJELLAUG, B. 1998. Spatio-temporal database support for legacy applications. In Proceedings of the 1998 ACM Symposium on Applied Computing (Atlanta, GA, Feb.), 226-234. 10.1145\u002F330560.330675",{},{"id":26,"text":1500,"url":26,"identifiers":1501},"CHENG , T. S. , AND GADIA , S. K. , 1994 . A pattern matching language for spatio-temporal databases . In Proceedings of the 3rd ACM International Conference on Information and Knowledge Management (CIKM '94 , Gaithersburg, MD, Nov. 28-Dec. 2). ACM Press, New York, NY , 288 - 295 . 10.1145\u002F191246.191296 CHENG, T. S., AND GADIA, S. K., 1994. A pattern matching language for spatio-temporal databases. In Proceedings of the 3rd ACM International Conference on Information and Knowledge Management (CIKM '94, Gaithersburg, MD, Nov. 28-Dec. 2). ACM Press, New York, NY, 288-295. 10.1145\u002F191246.191296",{},{"id":26,"text":1503,"url":26,"identifiers":1504},"CHOMICKI , J. AND REVESZ , P. 1997 . Constraint-based interoperability of spatio-temporal databases . In Proceedings of the 5th International Symposium on Large Spatial Databases ( Berlin, Germany) , 142 - 161 . CHOMICKI, J. AND REVESZ, P. 1997. Constraint-based interoperability of spatio-temporal databases. In Proceedings of the 5th International Symposium on Large Spatial Databases (Berlin, Germany), 142-161.",{},{"id":26,"text":1506,"url":26,"identifiers":1507},"CLIFFORD , J. 1982 . A model for historical databases . In Proceedings of the Workshop on Logical Bases for Data Bases (Dec.) , CLIFFORD, J. 1982. A model for historical databases. In Proceedings of the Workshop on Logical Bases for Data Bases (Dec.),",{},{"id":26,"text":1509,"url":26,"identifiers":1510},"CLIFFORD , J. AND CROKER , A. 1987 . The historical relational data model (HRDM) and algebra based on lifespans . In Proceedings of the Third IEEE International Conference on Data Engineering, IEEE Computer Society Press , Los Alamitos, CA , 528 - 537 . CLIFFORD, J. AND CROKER, A. 1987. The historical relational data model (HRDM) and algebra based on lifespans. In Proceedings of the Third IEEE International Conference on Data Engineering, IEEE Computer Society Press, Los Alamitos, CA, 528-537.",{},{"id":26,"text":1512,"url":26,"identifiers":1513},"10.1002\u002Fspe.4380240106",{"doi":1512},{"id":26,"text":1515,"url":26,"identifiers":1516},"10.1109\u002F69.273029",{"doi":1515},{"id":26,"text":1518,"url":26,"identifiers":1519},"10.1023\u002FA:1009805532638",{"doi":1518},{"id":26,"text":1521,"url":26,"identifiers":1522},"FORLIZZI , L. , G WING , R. H. , NARDELLI , E. , AND SCHNEIDER , M. 1999 . A data model and data structures for moving objects databases . In Proceedings of the ACM SIGMOD Conference on Management of Data ( Dallas, TX, May) , 319 - 330 . 10.1145\u002F342009.335426 FORLIZZI, L., G WING, R. H., NARDELLI, E., AND SCHNEIDER, M. 1999. A data model and data structures for moving objects databases. In Proceedings of the ACM SIGMOD Conference on Management of Data (Dallas, TX, May), 319-330. 10.1145\u002F342009.335426",{},{"id":26,"text":1524,"url":26,"identifiers":1525},"GAAL , S. 1964. Point Set Topology . Academic Press, Inc. , Duluth, MN . GAAL, S. 1964. Point Set Topology. Academic Press, Inc., Duluth, MN.",{},{"id":26,"text":1527,"url":26,"identifiers":1528},"10.1145\u002F49346.50065",{"doi":1527},{"id":26,"text":1530,"url":26,"identifiers":1531},"GARGANO , M. , NARDELLI , E. , AND TALAMO , M. 1991 . Abstract data types for the logical modeling of complex objects . Inf. Syst. 16 , 5 . GARGANO, M., NARDELLI, E., AND TALAMO, M. 1991. Abstract data types for the logical modeling of complex objects. Inf. Syst. 16, 5.",{"doi":1532},"10.1016\u002F0306-4379(91)90020-A",{"id":26,"text":1534,"url":26,"identifiers":1535},"10.1145\u002F276305.276324",{"doi":1534},{"id":26,"text":1537,"url":26,"identifiers":1538},"G WING , R. H. 1988 . Geo-relational algebra: A model and query language for geometric database systems . In Advances in Database Technology: EDBT '88 , J. W. Schmidt, S. Ceri, and M. Missikoff, Eds. , 506 - 527 . G WING, R. H. 1988. Geo-relational algebra: A model and query language for geometric database systems. In Advances in Database Technology: EDBT '88, J. W. Schmidt, S. Ceri, and M. Missikoff, Eds., 506-527.",{},{"id":26,"text":1540,"url":26,"identifiers":1541},"G WING , R. H. 1989 . Gral: an extensible relational database system for geometric applications . In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB '89 , Amsterdam, The Netherlands, Aug 22-25), P. G. Apers and G. Wiederhold, Eds. Morgan Kaufmann Publishers Inc., San Francisco, CA , 33 - 44 . G WING, R. H. 1989. Gral: an extensible relational database system for geometric applications. In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB '89, Amsterdam, The Netherlands, Aug 22-25), P. G. Apers and G. Wiederhold, Eds. Morgan Kaufmann Publishers Inc., San Francisco, CA, 33-44.",{},{"id":26,"text":1543,"url":26,"identifiers":1544},"G TING , R. H. 1993 . Second-order signature: A tool for specifying data models, query processing, and optimization . In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD '93 , Washington, DC, May 26-28), P. Buneman and S. Jajodia, Eds. ACM Press, New York, NY , 277 - 286 . 10.1145\u002F170035.170079 G TING, R. H. 1993. Second-order signature: A tool for specifying data models, query processing, and optimization. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD '93, Washington, DC, May 26-28), P. Buneman and S. Jajodia, Eds. ACM Press, New York, NY, 277-286. 10.1145\u002F170035.170079",{},{"id":26,"text":1546,"url":26,"identifiers":1547},"G TING , R. H. 1994 . An introduction to spatial database systems . VLDB J. 3 ( Oct. ), 357 - 399 . G TING, R. H. 1994. An introduction to spatial database systems. VLDB J. 3 (Oct.), 357-399.",{"doi":1548},"10.1007\u002FBF01231602",{"id":26,"text":1550,"url":26,"identifiers":1551},"10.1007\u002FBF01237921",{"doi":1550},{"id":26,"text":1553,"url":26,"identifiers":1554},"INFORMIX PRESS . 1997a. Extending Informix Universal Server: Data Types. Informix Software , Inc . INFORMIX PRESS. 1997a. Extending Informix Universal Server: Data Types. Informix Software, Inc.",{},{"id":26,"text":1556,"url":26,"identifiers":1557},"INFORMIX PRESS . 1997b. Informix Geodetic DataBlade Module: User's Guide. Informix Software , Inc . INFORMIX PRESS. 1997b. Informix Geodetic DataBlade Module: User's Guide. Informix Software, Inc.",{},{"id":26,"text":1559,"url":26,"identifiers":1560},"KLOPPROGGE , M. R. AND LOCKEMANN , P. C. 1983 . Modelling information preserving databases: Consequences of the concept of time . In Proceedings of the 1983 Conference on Very Large Data Bases, 399-416 . KLOPPROGGE, M. R. AND LOCKEMANN, P. C. 1983. Modelling information preserving databases: Consequences of the concept of time. In Proceedings of the 1983 Conference on Very Large Data Bases, 399-416.",{},{"id":26,"text":1562,"url":26,"identifiers":1563},"K MPKE , T. 1994 . Storing and retrieving changes in a sequence of polygons . Int. J. Geograph. Inf. Syst. 8 , 6 , 493 - 513 . K MPKE, T. 1994. Storing and retrieving changes in a sequence of polygons. Int. J. Geograph. Inf. Syst. 8, 6, 493-513.",{},{"id":26,"text":1565,"url":26,"identifiers":1566},"LOECKX , J. , EHRICH , H.-D. , AND WOLF , M. 1997. Specification of Abstract Data Types . Wiley\u002FTeubner computing series. John Wiley and Sons , Inc., New York, NY. LOECKX, J., EHRICH, H.-D., AND WOLF, M. 1997. Specification of Abstract Data Types. Wiley\u002FTeubner computing series. John Wiley and Sons, Inc., New York, NY.",{},{"id":26,"text":1568,"url":26,"identifiers":1569},"10.1109\u002F69.599935",{"doi":1568},{"id":26,"text":1571,"url":26,"identifiers":1572},"10.1145\u002F125137.125166",{"doi":1571},{"id":26,"text":1574,"url":26,"identifiers":1575},"MELTON , J. AND SIMON , A. R. 1993. Understanding the New SQL: A Complete Guide. Morgan Kaufmann series in data management systems . Morgan Kaufmann Publishers Inc ., San Francisco, CA. MELTON, J. AND SIMON, A. R. 1993. Understanding the New SQL: A Complete Guide. Morgan Kaufmann series in data management systems. Morgan Kaufmann Publishers Inc., San Francisco, CA.",{},{"id":26,"text":1577,"url":26,"identifiers":1578},"10.1109\u002F69.404027",{"doi":1577},{"id":26,"text":1580,"url":26,"identifiers":1581},"RAAFAT , H. , YANG , Z. , AND GAUTHIER , D. 1994 . Relational spatial topologies for historical geographic information . Int. J. Geograph. Inf. Syst. 8 , 2 , 163 - 173 . RAAFAT, H., YANG, Z., AND GAUTHIER, D. 1994. Relational spatial topologies for historical geographic information. Int. J. Geograph. Inf. Syst. 8, 2, 163-173.",{},{"id":26,"text":1583,"url":26,"identifiers":1584},"10.1109\u002F32.6141",{"doi":1583},{"id":26,"text":1586,"url":26,"identifiers":1587},"SCHOLL , M. AND VOISARD , A. 1989 . Thematic map modeling . In Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases (SSD '89 , Santa Barbara, CA, July 17 and 18), A. P. Buchmann, O. G nther, T. R. Smith, and Y.-F. Wang, Eds. Springer Lecture Notes in Computer Science , vol. 409 . Springer-Verlag, New York, NY, 167-190. SCHOLL, M. AND VOISARD, A. 1989. Thematic map modeling. In Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases (SSD '89, Santa Barbara, CA, July 17 and 18), A. P. Buchmann, O. G nther, T. R. Smith, and Y.-F. Wang, Eds. Springer Lecture Notes in Computer Science, vol. 409. Springer-Verlag, New York, NY, 167-190.",{},{"id":26,"text":1589,"url":26,"identifiers":1590},"SISTLA , A. P. , WOLFSON , O. , CHAMBERLAIN , S. , AND DAO , S. 1997 . Modeling and querying moving objects . In Proceedings of the 1997 International Conference on Data Engineering, 422-432 . SISTLA, A. P., WOLFSON, O., CHAMBERLAIN, S., AND DAO, S. 1997. Modeling and querying moving objects. In Proceedings of the 1997 International Conference on Data Engineering, 422-432.",{},{"id":26,"text":1592,"url":26,"identifiers":1593},"SNODGRASS , R. T. 1995. The TSQL2 Temporal Query Language . Kluwer Academic Publishers, Hingham , MA. SNODGRASS, R. T. 1995. The TSQL2 Temporal Query Language. Kluwer Academic Publishers, Hingham, MA.",{},{"id":26,"text":1595,"url":26,"identifiers":1596},"TANSEL , A. U. , CLIFFORD , J. , GADIA , S. , JAJODIA , S. , SEGEV , A. , AND SNODGRASS , R. , Eds. 1993. Temporal Databases: Theory, Design, and Implementation. Benjamin-Cummings Publ . Co., Inc., Redwood City, CA. TANSEL, A. U., CLIFFORD, J., GADIA, S., JAJODIA, S., SEGEV, A., AND SNODGRASS, R., Eds. 1993. Temporal Databases: Theory, Design, and Implementation. Benjamin-Cummings Publ. Co., Inc., Redwood City, CA.",{},{"id":26,"text":1598,"url":26,"identifiers":1599},"TILOVE , R. B. 1980 . Set membership classification: A unified approach to geometric intersection problems . IEEE Trans. Comput. C-29 , 874 - 883 . TILOVE, R. B. 1980. Set membership classification: A unified approach to geometric intersection problems. IEEE Trans. Comput. C-29, 874-883.",{"doi":1600},"10.1109\u002FTC.1980.1675470",{"id":26,"text":1602,"url":26,"identifiers":1603},"10.1007\u002Fs005300050094",{"doi":1602},{"id":26,"text":1605,"url":26,"identifiers":1606},"WORBOYS , F. 1994 . A unified model for spatial and temporal information . Comput. J. 37 , 1 , 25 - 34 . WORBOYS, F. 1994. A unified model for spatial and temporal information. Comput. J. 37, 1, 25-34.",{"doi":1607},"10.1093\u002Fcomjnl\u002F37.1.26",{"id":1609,"createTime":1610,"updateTime":1610,"relativeEntities":1611,"slug":1612,"properties":1613,"entityType":782,"verifyStatus":25,"verifyTime":1610,"verifyNote":784,"syncStatus":28,"languages":1625,"translateLanguages":26,"viewCount":36,"primaryUrl":1626,"fullTextUrl":26,"authors":1627,"publicationType":808,"publisherRelationship":1650,"citationCount":1688,"citationInfo":1689,"publishDate":1691,"publishYear":1692,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1693,"isForceReanalyzing":952},"176eea97-c39f-4486-8f68-08ef55c1711b","2024-12-26T21:18:33.305+00:00",[],"Join-indices",{"mag":1614,"keywords":1616,"openalex":1617,"abstract":1619,"title":1621,"doi":1623},{"VOID":1615},"2295596515",{},{"VOID":1618},"W2295596515",{"EN":1620},"\u003Cjats:p>In new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving the performance of joins in the context of complex queries. For most of the joins, updates to join indices incur very little overhead. Some properties of a join index are (i) its efficient use of memory and adaptiveness to parallel execution, (ii) its compatibility with other operations (including select and union), (iii) its support for abstract data type join predicates, (iv) its support for multirelation clustering, and (v) its use in representing directed graphs and in evaluating recursive queries. Finally, the analysis of the join algorithm using join indices shows its excellent performance.\u003C\u002Fjats:p>",{"EN":1622},"Join indices",{"VOID":1624},"10.1145\u002F22952.22955",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F22952.22955",[1628],{"id":1629,"sortIndex":36,"researcher":26,"roles":1630,"affiliations":1631,"properties":1643},"b9d95733-6438-46e5-b3ad-eda69b447c06",[],[1632],{"id":1633,"sortIndex":36,"affiliation":1634,"properties":26},"7f7fede5-19a3-41cf-a42e-68939efb85e9",{"id":1635,"createTime":1636,"updateTime":1637,"relativeEntities":1638,"slug":1639,"properties":1640,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"a7cec08f-5e4f-4f50-bd40-bf7fd8de60b0","2024-10-04T00:37:55.142+00:00","2024-12-26T21:18:33.324+00:00",[],"Microelectronics-and-Computer-Technology-Corporation-Austin-TX",{"title":1641},{"EN":1642},"Microelectronics and Computer Technology Corporation, Austin, TX",{"openalex":1644,"orcid":1646,"title":1648},{"VOID":1645},"A5041964026",{"VOID":1647},"https:\u002F\u002Forcid.org\u002F0000-0001-6506-7538",{"EN":1649},"Patrick Valduriez",{"url":26,"publisher":1651,"properties":1681},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1652,"slug":663,"properties":1653,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1659,"manageAffiliations":1660,"indexDatabases":1661,"url":744,"thumbnailPath":26,"statistic":1676,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1654,"issn":1655,"introduce":1656,"eissn":1657,"title":1658},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1662,1669],{"id":726,"indexDatabase":1663,"url":741,"indexYears":26,"academicFieldIds":1668,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1664,"label":1665,"description":1666,"key":737,"publicationTags":1667,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1670,"url":720,"indexYears":721,"academicFieldIds":1675,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1671,"label":1672,"description":1673,"key":717,"publicationTags":1674,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":1677,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":1678,"totalCitation":748,"totalCitationByYear":1679,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":1680,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":1682,"pages":1684,"issue":1686},{"VOID":1683},"12",{"VOID":1685},"218-246",{"VOID":1687},"2",511,{"total":1688,"publishYear":26,"statisticByYear":1690},{"2012":173,"2013":158,"2014":162,"2015":53,"2016":53,"2017":50,"2018":298,"2019":114,"2020":356,"2021":158,"2022":111,"2023":111,"2024":115},"1987-06-01",1987,[1694,1698,1701,1704,1707,1710,1713,1716,1719,1722,1725,1728,1731,1734,1737,1740,1743,1746,1749,1752,1755,1758,1761,1764],{"id":26,"text":1695,"url":26,"identifiers":1696},"BAYER R. AND MCCREIGHT E. Organization and maintenance of large ordered indexes. Acts inf. 1 3 1972.  BAYER R. AND MCCREIGHT E. Organization and maintenance of large ordered indexes. Acts inf. 1 3 1972.",{"doi":1697},"10.1007\u002FBF00288683",{"id":26,"text":1699,"url":26,"identifiers":1700},"10.1145\u002F319989.319991",{"doi":1699},{"id":26,"text":1702,"url":26,"identifiers":1703},"BITTON D., 1983, International Conference on Very Large Databases (Florence, 8",{},{"id":26,"text":1705,"url":26,"identifiers":1706},"10.1147\u002Fsj.164.0363",{"doi":1705},{"id":26,"text":1708,"url":26,"identifiers":1709},"BRATBERGSENGEN K., 1984, International Conference on Very Large Databases, 323",{},{"id":26,"text":1711,"url":26,"identifiers":1712},"10.1145\u002F320107.320109",{"doi":1711},{"id":26,"text":1714,"url":26,"identifiers":1715},"10.1145\u002F356770.356776",{"doi":1714},{"id":26,"text":1717,"url":26,"identifiers":1718},"10.1145\u002F318898.318923",{"doi":1717},{"id":26,"text":1720,"url":26,"identifiers":1721},"DEEN S. M., 1982, International Conference on Very Large Databases (Mexico City, 245",{},{"id":26,"text":1723,"url":26,"identifiers":1724},"10.1145\u002F602259.602261",{"doi":1723},{"id":26,"text":1726,"url":26,"identifiers":1727},"10.1145\u002F500080.500089",{"doi":1726},{"id":26,"text":1729,"url":26,"identifiers":1730},"10.1145\u002F359605.359618",{"doi":1729},{"id":26,"text":1732,"url":26,"identifiers":1733},"10.1145\u002F320263.320284",{"doi":1732},{"id":26,"text":1735,"url":26,"identifiers":1736},"HALL P., 1976, Ed. North-Holland, 201",{},{"id":26,"text":1738,"url":26,"identifiers":1739},"10.1145\u002F582353.582402",{"doi":1738},{"id":26,"text":1741,"url":26,"identifiers":1742},"KNUTH D., 1973, Mass.",{},{"id":26,"text":1744,"url":26,"identifiers":1745},"10.1145\u002F582353.582395",{"doi":1744},{"id":26,"text":1747,"url":26,"identifiers":1748},"10.1145\u002F319702.319729",{"doi":1747},{"id":26,"text":1750,"url":26,"identifiers":1751},"10.1145\u002F602259.602262",{"doi":1750},{"id":26,"text":1753,"url":26,"identifiers":1754},"TSICHRITZIS D., 1976, ACM SIGMOD International Conference on Management of Data (Washington, D.C., 123",{},{"id":26,"text":1756,"url":26,"identifiers":1757},"10.1145\u002F348.318590",{"doi":1756},{"id":26,"text":1759,"url":26,"identifiers":1760},"VALDURIEZ P., 1986, Proceedings o{ the 1st International Con{erence on Expert Database Systems (Charleston, S.C., 197",{},{"id":26,"text":1762,"url":26,"identifiers":1763},"VALDURIEZ P., 1986, VLDB Endowment Ed., 197",{},{"id":26,"text":1765,"url":26,"identifiers":1766},"10.1145\u002F359461.359475",{"doi":1765},{"id":1768,"createTime":1769,"updateTime":1769,"relativeEntities":1770,"slug":1771,"properties":1772,"entityType":782,"verifyStatus":25,"verifyTime":1769,"verifyNote":784,"syncStatus":28,"languages":1784,"translateLanguages":26,"viewCount":36,"primaryUrl":1785,"fullTextUrl":26,"authors":1786,"publicationType":808,"publisherRelationship":1878,"citationCount":751,"citationInfo":1915,"publishDate":1917,"publishYear":1248,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1918,"isForceReanalyzing":952},"3d233594-a99c-478e-bdc9-91783ba4e57d","2024-09-22T11:43:59.229+00:00",[],"Query-processing-in-a-system-for-distributed-databases-SDD-1-",{"mag":1773,"keywords":1775,"openalex":1776,"abstract":1778,"title":1780,"doi":1782},{"VOID":1774},"2023195086",{},{"VOID":1777},"W2023195086",{"EN":1779},"\u003Cjats:p>\n            This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage query into a relational calculus form called an\n            \u003Cjats:italic>envelope\u003C\u002Fjats:italic>\n            , which is essentially an aggregate-free QUEL query. This paper is primarily concerned with the optimization of envelopes.\n          \u003C\u002Fjats:p>\n          \u003Cjats:p>\n            Envelopes are processed in two phases. The first phase executes relational operations at various sites of the distributed database in order to delimit a subset of the database that contains all data relevant to the envelope. This subset is called a\n            \u003Cjats:italic>reduction\u003C\u002Fjats:italic>\n            of the database. The second phase transmits the reduction to one designated site, and the query is executed locally at that site.\n          \u003C\u002Fjats:p>\n          \u003Cjats:p>\n            The critical optimization problem is to perform the reduction phase efficiently. Success depends on designing a good repertoire of operators to use during this phase, and an effective algorithm for deciding which of these operators to use in processing a given envelope against a given database. The principal reduction operator that we employ is called a\n            \u003Cjats:italic>semijoin\u003C\u002Fjats:italic>\n            . In this paper we define the semijoin operator, explain why semijoin is an effective reduction operator, and present an algorithm that constructs a cost-effective program of semijoins, given an envelope and a database.\n          \u003C\u002Fjats:p>",{"EN":1781},"Query processing in a system for distributed databases (SDD-1)",{"VOID":1783},"10.1145\u002F319628.319650",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F319628.319650",[1787,1807,1822,1844,1859],{"id":1788,"sortIndex":36,"researcher":26,"roles":1789,"affiliations":1790,"properties":1802},"a9bea0c6-d2c8-48e7-9332-081c31f52f06",[],[1791],{"id":1792,"sortIndex":36,"affiliation":1793,"properties":26},"7b800dac-e990-4579-9b63-2bbd8904af68",{"id":1794,"createTime":1795,"updateTime":1796,"relativeEntities":1797,"slug":1798,"properties":1799,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"deacf48b-eb45-42df-9136-b15088b95899","2024-09-22T11:43:59.243+00:00","2024-12-30T02:18:05.252+00:00",[],"Harvard-University-Cambridge-Ma-TAB-",{"title":1800},{"EN":1801},"Harvard University, Cambridge, Ma.#TAB#",{"openalex":1803,"title":1805},{"VOID":1804},"A5057133004",{"EN":1806},"Philip A. Bernstein",{"id":1808,"sortIndex":59,"researcher":26,"roles":1809,"affiliations":1810,"properties":1817},"d5f10df5-7f56-44a1-a756-024db882f06f",[],[1811],{"id":1812,"sortIndex":36,"affiliation":1813,"properties":26},"f7b26732-7d7d-4365-ab53-e67df78bf964",{"id":795,"createTime":796,"updateTime":797,"relativeEntities":1814,"slug":799,"properties":1815,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1816},{"VI":802},{"openalex":1818,"title":1820},{"VOID":1819},"A5018089334",{"EN":1821},"Christopher L. Reeve",{"id":1823,"sortIndex":114,"researcher":26,"roles":1824,"affiliations":1825,"properties":1837},"c2518f58-ba09-4c18-b16c-d4d31e83c4f2",[],[1826],{"id":1827,"sortIndex":36,"affiliation":1828,"properties":26},"2db2833d-dab9-4c9c-8cbb-11f6d98c4000",{"id":1829,"createTime":1830,"updateTime":1831,"relativeEntities":1832,"slug":1833,"properties":1834,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"aae04825-fea7-47e1-8741-99647e9aadca","2024-01-05T23:38:03.528+00:00","2025-02-09T11:12:04.568+00:00",[],"University-of-California-at-Berkeley-Berkeley",{"title":1835},{"VI":1836},"University of California at Berkeley, Berkeley",{"openalex":1838,"orcid":1840,"title":1842},{"VOID":1839},"A5102911106",{"VOID":1841},"https:\u002F\u002Forcid.org\u002F0000-0003-1146-8285",{"EN":1843},"Eugene Wong",{"id":1845,"sortIndex":115,"researcher":26,"roles":1846,"affiliations":1847,"properties":1854},"cea5ae5d-25b3-43b3-a8b7-73df4f4aca68",[],[1848],{"id":1849,"sortIndex":36,"affiliation":1850,"properties":26},"e60d235a-fe11-4768-ac3a-47e83b7d1f53",{"id":1794,"createTime":1795,"updateTime":1796,"relativeEntities":1851,"slug":1798,"properties":1852,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1853},{"EN":1801},{"openalex":1855,"title":1857},{"VOID":1856},"A5046952414",{"EN":1858},"Nathan Goodman",{"id":1860,"sortIndex":111,"researcher":26,"roles":1861,"affiliations":1862,"properties":1873},"4fad0fc8-0726-4ea9-a1c1-d3f13a602269",[],[1863],{"id":1864,"sortIndex":36,"affiliation":1865,"properties":26},"82069675-60d2-4a3b-89c2-66ced1ea288e",{"id":1866,"createTime":1867,"updateTime":1867,"relativeEntities":1868,"slug":1869,"properties":1870,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"cb0ec96b-abe5-4626-994d-9b24448e394f","2024-09-22T11:43:59.310+00:00",[],"Computer-Corp-of-America-Cambridge-MA",{"title":1871},{"EN":1872},"Computer Corp. of America, Cambridge, MA",{"openalex":1874,"title":1876},{"VOID":1875},"A5028354898",{"EN":1877},"James B. Rothnie",{"url":26,"publisher":1879,"properties":1909},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1880,"slug":663,"properties":1881,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1887,"manageAffiliations":1888,"indexDatabases":1889,"url":744,"thumbnailPath":26,"statistic":1904,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1882,"issn":1883,"introduce":1884,"eissn":1885,"title":1886},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1890,1897],{"id":726,"indexDatabase":1891,"url":741,"indexYears":26,"academicFieldIds":1896,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":1892,"label":1893,"description":1894,"key":737,"publicationTags":1895,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":1898,"url":720,"indexYears":721,"academicFieldIds":1903,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":1899,"label":1900,"description":1901,"key":717,"publicationTags":1902,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":1905,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":1906,"totalCitation":748,"totalCitationByYear":1907,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":1908,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":1910,"pages":1911,"issue":1913},{"VOID":1240},{"VOID":1912},"602-625",{"VOID":1914},"4",{"total":751,"publishYear":26,"statisticByYear":1916},{"2012":53,"2013":51,"2014":52,"2015":50,"2016":52,"2017":52,"2018":53,"2019":116,"2020":59,"2021":135,"2022":111,"2023":59},"1981-12-01",[1919,1922,1925,1928,1931,1934,1937,1940,1943,1946,1949,1952,1955,1958,1961,1964,1967,1970,1973,1976,1979,1982,1985,1988,1991,1994,1997,2000,2002],{"id":26,"text":1920,"url":26,"identifiers":1921},"10.1145\u002F320064.320065",{"doi":1920},{"id":26,"text":1923,"url":26,"identifiers":1924},"10.1145\u002F322234.322238",{"doi":1923},{"id":26,"text":1926,"url":26,"identifiers":1927},"10.1137\u002F0210059",{"doi":1926},{"id":26,"text":1929,"url":26,"identifiers":1930},"BERNSTEIN P.A. AN}) GOODMAN N. The power of inequality semi-joins. To appear in Inf. Syst.  BERNSTEIN P.A. AN}) GOODMAN N. The power of inequality semi-joins. To appear in Inf. Syst.",{},{"id":26,"text":1932,"url":26,"identifiers":1933},"10.1145\u002F320128.320133",{"doi":1932},{"id":26,"text":1935,"url":26,"identifiers":1936},"10.1145\u002F320128.320131",{"doi":1935},{"id":26,"text":1938,"url":26,"identifiers":1939},"10.1145\u002F582250.582277",{"doi":1938},{"id":26,"text":1941,"url":26,"identifiers":1942},"DATE , C.J. An Introduction to Database Systems . Addison-Wesley , Reading, Mass ., 1977 . DATE, C.J. An Introduction to Database Systems. Addison-Wesley, Reading, Mass., 1977.",{},{"id":26,"text":1944,"url":26,"identifiers":1945},"10.1145\u002F509252.509292",{"doi":1944},{"id":26,"text":1947,"url":26,"identifiers":1948},"10.1145\u002F319758.319775",{"doi":1947},{"id":26,"text":1950,"url":26,"identifiers":1951},"10.1145\u002F582318.582344",{"doi":1950},{"id":26,"text":1953,"url":26,"identifiers":1954},"10.1145\u002F320610.320621",{"doi":1953},{"id":26,"text":1956,"url":26,"identifiers":1957},"HELD , G.D. , STONEBRAKER , M. , AND WONG , W. INGRES--A relational database management system . In Proc. AFIPS 1975 NCC , vol. 44 , AFIPS Press, Arlington, Va. , pp. 409 - 416 . HELD, G.D., STONEBRAKER, M., AND WONG, W. INGRES--A relational database management system. In Proc. AFIPS 1975 NCC, vol. 44, AFIPS Press, Arlington, Va., pp. 409-416.",{},{"id":26,"text":1959,"url":26,"identifiers":1960},"HEVNER , A.R. , AND YAO , S.B. Query processing in distributed database systems. IEEE Trans. Softw. Eng. SE . 5 , 3 ( May 1979 ), 177-187. HEVNER, A.R., AND YAO, S.B. Query processing in distributed database systems. IEEE Trans. Softw. Eng. SE.5, 3 (May 1979), 177-187.",{},{"id":26,"text":1962,"url":26,"identifiers":1963},"10.1137\u002F0114108",{"doi":1962},{"id":26,"text":1965,"url":26,"identifiers":1966},"KERSCHBERG , L. , TING , P.D. , AND YAO , S.B. Query optimization in star computer networks. Unpublished Rep., Bell Laboratories, Holmdel, N.J. , 1980 . KERSCHBERG, L., TING, P.D., AND YAO, S.B. Query optimization in star computer networks. Unpublished Rep., Bell Laboratories, Holmdel, N.J., 1980.",{},{"id":26,"text":1968,"url":26,"identifiers":1969},"MARILL , T. , AND STERN , D.H. The datacomputer : A network data utility . In Proc. AFIPS 1975 NCC , vol. 44 , AFIPS Press, Arlington, Va. MARILL, T., AND STERN, D.H. The datacomputer: A network data utility. In Proc. AFIPS 1975 NCC, vol. 44, AFIPS Press, Arlington, Va.",{},{"id":26,"text":1971,"url":26,"identifiers":1972},"10.1145\u002F320544.320553",{"doi":1971},{"id":26,"text":1974,"url":26,"identifiers":1975},"10.1145\u002F320128.320129",{"doi":1974},{"id":26,"text":1977,"url":26,"identifiers":1978},"ROTHNIE , J.B. , AND GOODMAN , N. An overview of the preliminary design of SDD-1 . In Proc. Berkeley Workshop Distributed Data Management and Computer Newtorks , May 1977 , pp. 39 - 57 . ROTHNIE, J.B., AND GOODMAN, N. An overview of the preliminary design of SDD-1. In Proc. Berkeley Workshop Distributed Data Management and Computer Newtorks, May 1977, pp. 39-57.",{},{"id":26,"text":1980,"url":26,"identifiers":1981},"Ro ~I tN Iz, J .B., A~D GOOD , N, N . A survey of research and develoment in distributed database systems . In Proc. 3rd Int. Conf. Very Large Databases , Oct. 1977 , pp. 48 - 61 . Ro~ItNIz, J.B., A~D GOOD,N, N. A survey of research and develoment in distributed database systems. In Proc. 3rd Int. Conf. Very Large Databases, Oct. 1977, pp. 48-61.",{},{"id":26,"text":1983,"url":26,"identifiers":1984},"ROTHNIE , J.B. , GOODMAN , N. , AND MARILL , T. Database architecture in a network environment . In Protocols and Techniques for Data Communication Networks , F.F. Kuo, Ed. Prentice-Hall, Englewood Cliffs , N.J. , 1980 . ROTHNIE, J.B., GOODMAN, N., AND MARILL, T. Database architecture in a network environment. In Protocols and Techniques for Data Communication Networks, F.F. Kuo, Ed. Prentice-Hall, Englewood Cliffs, N.J., 1980.",{},{"id":26,"text":1986,"url":26,"identifiers":1987},"SELINGER , P.G. , AND ADIBA , M. Access path selection in distributed database management systems . In Proc. Int. Conf. Databases , Univ. Aberdeen, Aberdeen, Scotland , July 1980 . SELINGER, P.G., AND ADIBA, M. Access path selection in distributed database management systems. In Proc. Int. Conf. Databases, Univ. Aberdeen, Aberdeen, Scotland, July 1980.",{},{"id":26,"text":1989,"url":26,"identifiers":1990},"10.1145\u002F582095.582099",{"doi":1989},{"id":26,"text":1992,"url":26,"identifiers":1993},"10.1145\u002F320241.320246",{"doi":1992},{"id":26,"text":1995,"url":26,"identifiers":1996},"WoNt, E. Retrieving dispersed data from SDD-1 . In Proc. Berkeley Workshop Distributed Data Management and Computer Networks , May 1977 , pp. 217 - 235 . WoNt, E. Retrieving dispersed data from SDD-1. In Proc. Berkeley Workshop Distributed Data Management and Computer Networks, May 1977, pp. 217-235.",{},{"id":26,"text":1998,"url":26,"identifiers":1999},"10.1145\u002F320473.320479",{"doi":1998},{"id":26,"text":1765,"url":26,"identifiers":2001},{"doi":1765},{"id":26,"text":2003,"url":26,"identifiers":2004},"Yu, C.T., AND OZSOYOOLU , M.Z. An algorithm for tree-query membership of a distributed query . In Proc. Compsac79 , IEEE Computer Society , Nov. 1979 , pp. 306 - 312 . Yu, C.T., AND OZSOYOOLU, M.Z. An algorithm for tree-query membership of a distributed query. In Proc. Compsac79, IEEE Computer Society, Nov. 1979, pp. 306-312.",{},{"id":2006,"createTime":2007,"updateTime":2007,"relativeEntities":2008,"slug":2009,"properties":2010,"entityType":782,"verifyStatus":25,"verifyTime":2007,"verifyNote":784,"syncStatus":28,"languages":2022,"translateLanguages":26,"viewCount":36,"primaryUrl":2023,"fullTextUrl":26,"authors":2024,"publicationType":808,"publisherRelationship":2084,"citationCount":753,"citationInfo":2121,"publishDate":2123,"publishYear":2124,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2125,"isForceReanalyzing":952},"6efd19f5-03c3-4d7f-92e9-a94487f59a41","2024-09-24T22:39:24.398+00:00",[],"A-linear-time-probabilistic-counting-algorithm-for-database-applications",{"mag":2011,"keywords":2013,"openalex":2014,"abstract":2016,"title":2018,"doi":2020},{"VOID":2012},"2008365755",{},{"VOID":2015},"W2008365755",{"EN":2017},"\u003Cjats:p>\n            We present a probabilistic algorithm for counting the number of unique values in the presence of duplicates. This algorithm has\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (\n            \u003Cjats:italic>q\u003C\u002Fjats:italic>\n            ) time complexity, where\n            \u003Cjats:italic>q\u003C\u002Fjats:italic>\n            is the number of values including duplicates, and produces an estimation with an arbitrary accuracy prespecified by the user using only a small amount of space. Traditionally, accurate counts of unique values were obtained by sorting, which has\n            \u003Cjats:italic>O\u003C\u002Fjats:italic>\n            (\n            \u003Cjats:italic>q\u003C\u002Fjats:italic>\n            log\n            \u003Cjats:italic>q\u003C\u002Fjats:italic>\n            ) time complexity. Our technique, called\n            \u003Cjats:italic>linear counting\u003C\u002Fjats:italic>\n            , is based on hashing. We present a comprehensive theoretical and experimental analysis of linear counting. The analysis reveals an interesting result: A load factor (number of unique values\u002Fhash table size) much larger than 1.0 (e.g., 12) can be used for accurate estimation (e.g., 1% of error). We present this technique with two important applications to database problems: namely, (1) obtaining the column cardinality (the number of unique values in a column of a relation) and (2) obtaining the join selectivity (the number of unique values in the join column resulting from an unconditional join divided by the number of unique join column values in the relation to he joined). These two parameters are important statistics that are used in relational query optimization and physical database design.\n          \u003C\u002Fjats:p>",{"EN":2019},"A linear-time probabilistic counting algorithm for database applications",{"VOID":2021},"10.1145\u002F78922.78925",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F78922.78925",[2025,2045,2064],{"id":2026,"sortIndex":115,"researcher":26,"roles":2027,"affiliations":2028,"properties":2040},"d17725fe-3362-4d4c-91bc-3a8c4d6b4c24",[],[2029],{"id":2030,"sortIndex":36,"affiliation":2031,"properties":26},"075ef247-b4b7-417d-b3a1-f977d2c0603b",{"id":2032,"createTime":2033,"updateTime":2034,"relativeEntities":2035,"slug":2036,"properties":2037,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3d634af7-0d66-483a-82a9-4146b055a401","2024-04-13T16:16:28.371+00:00","2024-11-26T20:03:35.182+00:00",[],"-Cornell-Univ-Ithaca-NY-",{"title":2038},{"EN":2039},"[Cornell Univ., Ithaca, NY]",{"openalex":2041,"title":2043},{"VOID":2042},"A5075287817",{"EN":2044},"Brad T. Vander-Zanden",{"id":2046,"sortIndex":114,"researcher":26,"roles":2047,"affiliations":2048,"properties":2059},"f563f283-ad80-4da9-baf7-45958ac3bb49",[],[2049],{"id":2050,"sortIndex":36,"affiliation":2051,"properties":26},"b1485197-2039-4b82-9176-d762797932e0",{"id":2052,"createTime":2053,"updateTime":2053,"relativeEntities":2054,"slug":2055,"properties":2056,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e387f34e-9faa-49df-aff2-1f8ef9f2d98b","2024-09-24T22:39:24.434+00:00",[],"Univ-of-Delaware-Newark",{"title":2057},{"EN":2058},"Univ. of Delaware, Newark",{"openalex":2060,"title":2062},{"VOID":2061},"A5071606094",{"EN":2063},"Howard M. Taylor",{"id":2065,"sortIndex":36,"researcher":26,"roles":2066,"affiliations":2067,"properties":2079},"7a1fc3d7-1538-4f9f-b9b3-13a7cd4c9bd1",[],[2068],{"id":2069,"sortIndex":36,"affiliation":2070,"properties":26},"bd0b5575-edcd-4486-b337-4e1a67514975",{"id":2071,"createTime":2072,"updateTime":2073,"relativeEntities":2074,"slug":2075,"properties":2076,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e85319c2-736b-4f41-8441-2d0ea37d152b","2023-12-13T18:45:41.323+00:00","2024-11-26T00:50:59.527+00:00",[],"Korea-Advanced-Institute-of-Science-and-Technology-Seoul-Korea",{"title":2077},{"VI":2078},"Korea Advanced Institute of Science and Technology, Seoul, Korea",{"openalex":2080,"title":2082},{"VOID":2081},"A5021272202",{"EN":2083},"Kyu-Young Whang",{"url":26,"publisher":2085,"properties":2115},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2086,"slug":663,"properties":2087,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2093,"manageAffiliations":2094,"indexDatabases":2095,"url":744,"thumbnailPath":26,"statistic":2110,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2088,"issn":2089,"introduce":2090,"eissn":2091,"title":2092},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2096,2103],{"id":726,"indexDatabase":2097,"url":741,"indexYears":26,"academicFieldIds":2102,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2098,"label":2099,"description":2100,"key":737,"publicationTags":2101,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2104,"url":720,"indexYears":721,"academicFieldIds":2109,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2105,"label":2106,"description":2107,"key":717,"publicationTags":2108,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":2111,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":2112,"totalCitation":748,"totalCitationByYear":2113,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":2114,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":2116,"pages":2118,"issue":2120},{"VOID":2117},"15",{"VOID":2119},"208-229",{"VOID":1687},{"total":753,"publishYear":26,"statisticByYear":2122},{"2012":516,"2013":51,"2014":516,"2015":356,"2016":241,"2017":244,"2018":260,"2019":222,"2020":173,"2021":255,"2022":396,"2023":241,"2024":103},"1990-06-01",1990,[2126,2129,2132,2135,2138,2141,2144,2147,2150,2153,2156,2158,2161,2164,2167,2170,2173,2176,2179],{"id":26,"text":2127,"url":26,"identifiers":2128},"10.1016\u002F0306-4379(87)90014-7",{"doi":2127},{"id":26,"text":2130,"url":26,"identifiers":2131},"10.1145\u002F319983.319987",{"doi":2130},{"id":26,"text":2133,"url":26,"identifiers":2134},"CONTE , S. D. , AND DE BOOR , C. Elementary Numerical Analysis: An Algorithmic Approach . 3 rd ed., McGraw-Hill , New York , 1980 . CONTE, S. D., AND DE BOOR, C. Elementary Numerical Analysis: An Algorithmic Approach. 3rd ed., McGraw-Hill, New York, 1980.",{},{"id":26,"text":2136,"url":26,"identifiers":2137},"DEMOLOMBE , R. Estimation of the number of tuples satisfying a query expressed in predicate calculus language . In Proceedings of the 6th International Conference on Very Large Data Bases , 1980 , pp. 55 - 63 . DEMOLOMBE, R. Estimation of the number of tuples satisfying a query expressed in predicate calculus language. In Proceedings of the 6th International Conference on Very Large Data Bases, 1980, pp. 55-63.",{},{"id":26,"text":2139,"url":26,"identifiers":2140},"FELLER , W. An Introduction to Probability Theory and Its Applications . Vol. 1 , 3 rd ed., Wiley , New York , 1968 . FELLER, W. An Introduction to Probability Theory and Its Applications. Vol. 1, 3rd ed., Wiley, New York, 1968.",{},{"id":26,"text":2142,"url":26,"identifiers":2143},"10.5555\u002F645910.673455",{"doi":2142},{"id":26,"text":2145,"url":26,"identifiers":2146},"JOHNSON , N. L. , AND KOTZ , S. Urn Models and Their Application . Wiley , New York , 1977 . JOHNSON, N. L., AND KOTZ, S. Urn Models and Their Application. Wiley, New York, 1977.",{},{"id":26,"text":2148,"url":26,"identifiers":2149},"MOOD , A. M. , GRAYBILL , F. A. , AND BOES , D.C. Introduction to the Theory of Statistics . 3 rd ed., McGraw-Hill , New York , 1974 . MOOD, A. M., GRAYBILL, F. A., AND BOES, D.C. Introduction to the Theory of Statistics. 3rd ed., McGraw-Hill, New York, 1974.",{},{"id":26,"text":2151,"url":26,"identifiers":2152},"10.5555\u002F645913.671474",{"doi":2151},{"id":26,"text":2154,"url":26,"identifiers":2155},"10.1109\u002FTSE.1985.231855",{"doi":2154},{"id":26,"text":1989,"url":26,"identifiers":2157},{"doi":1989},{"id":26,"text":2159,"url":26,"identifiers":2160},"10.1214\u002Faoms\u002F1177729794",{"doi":2159},{"id":26,"text":2162,"url":26,"identifiers":2163},"VANDER-ZANDEN , B. W. , TAYLOR , H. M. , AND BITTON , D. Estimating block accesses when attributes are correlated . In Proceedings of the 12th International Conference on Very Large Data Bases (Kyoto , Aug. 1986 ), pp. 119 - 127 . VANDER-ZANDEN, B. W., TAYLOR, H. M., AND BITTON, D. Estimating block accesses when attributes are correlated. In Proceedings of the 12th International Conference on Very Large Data Bases (Kyoto, Aug. 1986), pp. 119-127.",{},{"id":26,"text":2165,"url":26,"identifiers":2166},"10.1145\u002F182.358452",{"doi":2165},{"id":26,"text":2168,"url":26,"identifiers":2169},"10.1109\u002FTC.1984.1676418",{"doi":2168},{"id":26,"text":2171,"url":26,"identifiers":2172},"WIEDERHOLD , G. , AND EL-MARS 1, R. The structural model for database design , in Proceedings of the International Conference on Entity Relationship Approach ( Los Angeles , Dec. 1979 ), pp. 247 - 267 . WIEDERHOLD, G., AND EL-MARS1, R. The structural model for database design, in Proceedings of the International Conference on Entity Relationship Approach (Los Angeles, Dec. 1979), pp. 247-267.",{},{"id":26,"text":2174,"url":26,"identifiers":2175},"W| EDERHOLD , G. Database Design . 2 nd ed., McGraw-Hill , New York , 1983 . W|EDERHOLD, G. Database Design. 2nd ed., McGraw-Hill, New York, 1983.",{},{"id":26,"text":2177,"url":26,"identifiers":2178},"10.1109\u002FVLDB.1979.718156",{"doi":2177},{"id":26,"text":2180,"url":26,"identifiers":2181},"10.1145\u002F582095.582109",{"doi":2180},{"id":2183,"createTime":2184,"updateTime":2184,"relativeEntities":2185,"slug":2186,"properties":2187,"entityType":782,"verifyStatus":25,"verifyTime":2184,"verifyNote":784,"syncStatus":28,"languages":2199,"translateLanguages":26,"viewCount":36,"primaryUrl":2200,"fullTextUrl":26,"authors":2201,"publicationType":808,"publisherRelationship":2223,"citationCount":2261,"citationInfo":2262,"publishDate":2264,"publishYear":2265,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2266,"isForceReanalyzing":952},"f4cb1f33-fe7b-4e5d-b016-4eaee2999464","2024-09-22T11:43:56.974+00:00",[],"On-optimizing-an-SQL-like-nested-query",{"mag":2188,"keywords":2190,"openalex":2191,"abstract":2193,"title":2195,"doi":2197},{"VOID":2189},"2008116177",{},{"VOID":2192},"W2008116177",{"EN":2194},"\u003Cjats:p>SQL is a high-level nonprocedural data language which has received wide recognition in relational databases. One of the most interesting features of SQL is the nesting of query blocks to an arbitrary depth. An SQL-like query nested to an arbitrary depth is shown to be composed of five basic types of nesting. Four of them have not been well understood and more work needs to be done to improve their execution efficiency. Algorithms are developed that transform queries involving these basic types of nesting into semantically equivalent queries that are amenable to efficient processing by existing query-processing subsystems. These algorithms are then combined into a coherent strategy for processing a general nested query of arbitrary complexity.\u003C\u002Fjats:p>",{"EN":2196},"On optimizing an SQL-like nested query",{"VOID":2198},"10.1145\u002F319732.319745",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F319732.319745",[2202],{"id":2203,"sortIndex":36,"researcher":26,"roles":2204,"affiliations":2205,"properties":2216},"c66505f9-aa03-46c2-b9c8-5d08417f2a58",[],[2206],{"id":2207,"sortIndex":36,"affiliation":2208,"properties":26},"bd382c41-bcdf-4e78-a530-3cfdea0d488c",{"id":2209,"createTime":2210,"updateTime":2210,"relativeEntities":2211,"slug":2212,"properties":2213,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"5f056d50-5f60-4ac4-9307-0afa3f78bd82","2024-09-22T11:43:56.991+00:00",[],"IBM-Research-San-Jose-CA",{"title":2214},{"EN":2215},"IBM Research, San Jose, CA",{"openalex":2217,"orcid":2219,"title":2221},{"VOID":2218},"A5100348843",{"VOID":2220},"https:\u002F\u002Forcid.org\u002F0000-0002-1251-9681",{"EN":2222},"Won Bae Kim",{"url":26,"publisher":2224,"properties":2254},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2225,"slug":663,"properties":2226,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2232,"manageAffiliations":2233,"indexDatabases":2234,"url":744,"thumbnailPath":26,"statistic":2249,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2227,"issn":2228,"introduce":2229,"eissn":2230,"title":2231},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2235,2242],{"id":726,"indexDatabase":2236,"url":741,"indexYears":26,"academicFieldIds":2241,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2237,"label":2238,"description":2239,"key":737,"publicationTags":2240,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2243,"url":720,"indexYears":721,"academicFieldIds":2248,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2244,"label":2245,"description":2246,"key":717,"publicationTags":2247,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":2250,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":2251,"totalCitation":748,"totalCitationByYear":2252,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":2253,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":2255,"pages":2257,"issue":2259},{"VOID":2256},"7",{"VOID":2258},"443-469",{"VOID":2260},"3",390,{"total":2261,"publishYear":26,"statisticByYear":2263},{"2012":52,"2013":162,"2014":116,"2015":50,"2016":162,"2017":298,"2018":111,"2019":111,"2020":135,"2021":135,"2022":59,"2023":114,"2024":59},"1982-09-01",1982,[2267,2270,2272,2275,2277,2279,2282,2284,2287,2290,2292,2295,2298,2301,2304,2307,2310,2313,2316,2318,2321,2323,2326,2329],{"id":26,"text":2268,"url":26,"identifiers":2269},"10.1145\u002F361020.361215",{"doi":2268},{"id":26,"text":1254,"url":26,"identifiers":2271},{"doi":1254},{"id":26,"text":2273,"url":26,"identifiers":2274},"BLASGBN M.W., 1976, Calif.",{},{"id":26,"text":1705,"url":26,"identifiers":2276},{"doi":1705},{"id":26,"text":873,"url":26,"identifiers":2278},{"doi":873},{"id":26,"text":2280,"url":26,"identifiers":2281},"CHA RLIN, 1976, A unified approach to data definition, manipulation, and control, IBM J. Res. Dev., 560",{},{"id":26,"text":879,"url":26,"identifiers":2283},{"doi":879},{"id":26,"text":2285,"url":26,"identifiers":2286},"CODD E.F., 1971, Proc. ACM SIGFI- DET Workshop on Data Description, Access and Control, 35",{},{"id":26,"text":2288,"url":26,"identifiers":2289},"CODD E.F., 1971, Data Base Systems, Courant Computer Science Symposia",{},{"id":26,"text":2288,"url":26,"identifiers":2291},{},{"id":26,"text":2293,"url":26,"identifiers":2294},"CZARNIK B., 1975, Proc. ACM Pacific Regional Conf., 21",{},{"id":26,"text":2296,"url":26,"identifiers":2297},"DATE C.J., 1977, An Introduction to Database Systems, 2",{},{"id":26,"text":2299,"url":26,"identifiers":2300},"EPSTEIN R., 1979, Electronics Research Laboratory",{},{"id":26,"text":2302,"url":26,"identifiers":2303},"10.1145\u002F800179.810175",{"doi":2302},{"id":26,"text":2305,"url":26,"identifiers":2306},"MYLOPOULOS J., Proc. 1975 AFIPS Nat. Computer Conf., 44, 403",{},{"id":26,"text":2308,"url":26,"identifiers":2309},"PALERMO F.P., 1972, Calif.",{},{"id":26,"text":2311,"url":26,"identifiers":2312},"10.1145\u002F800296.811517",{"doi":2311},{"id":26,"text":2314,"url":26,"identifiers":2315},"ROTHNIE J.B., Proc. 1975 AFIPS Nat. Computer Conf., 44, 417",{},{"id":26,"text":1989,"url":26,"identifiers":2317},{"doi":1989},{"id":26,"text":2319,"url":26,"identifiers":2320},"10.1145\u002F361020.361025",{"doi":2319},{"id":26,"text":1294,"url":26,"identifiers":2322},{"doi":1294},{"id":26,"text":2324,"url":26,"identifiers":2325},"WEELDREYER J.A., 1978, Proc. llth Hawaii Int. Conf. Systems Science, 52",{},{"id":26,"text":2327,"url":26,"identifiers":2328},"WE, 1980, The ORACLE data base management system. Mini-Micro Syst. (Aug",{},{"id":26,"text":1998,"url":26,"identifiers":2330},{"doi":1998},{"id":2332,"createTime":2333,"updateTime":2333,"relativeEntities":2334,"slug":2335,"properties":2336,"entityType":782,"verifyStatus":25,"verifyTime":2333,"verifyNote":784,"syncStatus":28,"languages":2347,"translateLanguages":26,"viewCount":36,"primaryUrl":2348,"fullTextUrl":26,"authors":2349,"publicationType":808,"publisherRelationship":2383,"citationCount":2419,"citationInfo":2420,"publishDate":2422,"publishYear":855,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2423,"isForceReanalyzing":952},"f8618686-ad9b-4af1-b97d-c1c94d396fb4","2024-09-22T11:43:57.681+00:00",[],"Decomposition-a-strategy-for-query-processing",{"mag":2337,"keywords":2339,"openalex":2340,"abstract":2342,"title":2344,"doi":2346},{"VOID":2338},"2169012378",{},{"VOID":2341},"W2169012378",{"EN":2343},"\u003Cjats:p>Strategy for processing multivariable queries in the database management system INGRES is considered. The general procedure is to decompose the query into a sequence of one-variable queries by alternating between (a) reduction: breaking off components of the query which are joined to it by a single variable, and (b) tuple substitution: substituting for one of the variables a tuple at a time. Algorithms for reduction and for choosing the variable to be substituted are given. In most cases the latter decision depends on estimation of costs; heuristic procedures for making such estimates are outlined.\u003C\u002Fjats:p>",{"EN":2345},"Decomposition—a strategy for query processing",{"VOID":1998},[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F320473.320479",[2350,2369],{"id":2351,"sortIndex":115,"researcher":26,"roles":2352,"affiliations":2353,"properties":2364},"333eafaa-7875-4f06-a498-671d32dca9a9",[],[2354],{"id":2355,"sortIndex":36,"affiliation":2356,"properties":26},"07d8563c-445d-4079-9942-baef5dda1dbe",{"id":2357,"createTime":2358,"updateTime":2358,"relativeEntities":2359,"slug":2360,"properties":2361,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"666efe67-dc3e-4faa-8887-f438a1867678","2024-09-22T11:43:57.700+00:00",[],"Univ-of-California-Berkeley-Berkeley",{"title":2362},{"EN":2363},"Univ. of California, Berkeley, Berkeley",{"openalex":2365,"title":2367},{"VOID":2366},"A5082882513",{"EN":2368},"Karel Youssefi",{"id":2370,"sortIndex":36,"researcher":26,"roles":2371,"affiliations":2372,"properties":2379},"952e09b1-a08c-48e5-997d-e88fffbf0318",[],[2373],{"id":2374,"sortIndex":36,"affiliation":2375,"properties":26},"6bc5ca2f-e5c6-4eb1-9540-31d207c7c2f7",{"id":2357,"createTime":2358,"updateTime":2358,"relativeEntities":2376,"slug":2360,"properties":2377,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2378},{"EN":2363},{"openalex":2380,"orcid":2381,"title":2382},{"VOID":1839},{"VOID":1841},{"EN":1843},{"url":26,"publisher":2384,"properties":2414},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2385,"slug":663,"properties":2386,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2392,"manageAffiliations":2393,"indexDatabases":2394,"url":744,"thumbnailPath":26,"statistic":2409,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2387,"issn":2388,"introduce":2389,"eissn":2390,"title":2391},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2395,2402],{"id":726,"indexDatabase":2396,"url":741,"indexYears":26,"academicFieldIds":2401,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2397,"label":2398,"description":2399,"key":737,"publicationTags":2400,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2403,"url":720,"indexYears":721,"academicFieldIds":2408,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2404,"label":2405,"description":2406,"key":717,"publicationTags":2407,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":2410,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":2411,"totalCitation":748,"totalCitationByYear":2412,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":2413,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":2415,"pages":2416,"issue":2418},{"VOID":842},{"VOID":2417},"223-241",{"VOID":2260},387,{"total":2419,"publishYear":26,"statisticByYear":2421},{"2012":111,"2013":114,"2014":114,"2015":135,"2018":238,"2019":162,"2020":115,"2021":162,"2022":59,"2023":114},"1976-09-01",[2424,2427,2429,2432,2435,2438,2441,2444,2447,2450,2452,2455,2457,2459,2462],{"id":26,"text":2425,"url":26,"identifiers":2426},"ALLMAN , E. , AND STONE }BR AKER , M. Embedding a relational data sub-language in a general purpose programming language. ERL Mem. No. M564 , Electronics l~esearch Lab., U. of California , Berkeley, Calif ., Oct. 1974 . ALLMAN, E., AND STONE}BRAKER, M. Embedding a relational data sub-language in a general purpose programming language. ERL Mem. No. M564, Electronics l~esearch Lab., U. of California, Berkeley, Calif., Oct. 1974.",{},{"id":26,"text":2268,"url":26,"identifiers":2428},{"doi":2268},{"id":26,"text":2430,"url":26,"identifiers":2431},"CODD , E.F. Seven steps to rendezvous with the casual user . Proc. IFIP TC-2 Working Conf. on Data Base Management Systems , Cargese, Corsica , April 1974 . CODD, E.F. Seven steps to rendezvous with the casual user. Proc. IFIP TC-2 Working Conf. on Data Base Management Systems, Cargese, Corsica, April 1974.",{},{"id":26,"text":2433,"url":26,"identifiers":2434},"HELD , G.D. , STONEBRAKER , M. , AND WONG , E. INGRES--a relational data base management system . Proc. AFIPS 1975 NCC , Vol. 44 , AFIPS Press, Montvale, N.J. , pp. 409 - 416 . HELD, G.D., STONEBRAKER, M., AND WONG, E. INGRES--a relational data base management system. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 409-416.",{},{"id":26,"text":2436,"url":26,"identifiers":2437},"Mc DONALD , N. , AND STONEBRAKER , M. Cupid--the friendly query language. ERL Mem. No. M487 , Electronics Research Lab., U. of California , Berkeley, Calif ., Oct. 1974 . McDONALD, N., AND STONEBRAKER, M. Cupid--the friendly query language. ERL Mem. No. M487, Electronics Research Lab., U. of California, Berkeley, Calif., Oct. 1974.",{},{"id":26,"text":2439,"url":26,"identifiers":2440},"PALERMO , E.P. A data base search problem . Proc. 4th Int. Symp. on Computers and Information Science, Miami Beach, Fla. , Dec. 1972 . PALERMO, E.P. A data base search problem. Proc. 4th Int. Symp. on Computers and Information Science, Miami Beach, Fla., Dec. 1972.",{},{"id":26,"text":2442,"url":26,"identifiers":2443},"PECH~R~R , R.M. Efficient evaluation of expressions in a relational algebra . Proc. ACM Pacific 75 Conf. , April 1975 , pp. 44 -- 49 . PECH~R~R, R.M. Efficient evaluation of expressions in a relational algebra. Proc. ACM Pacific 75 Conf., April 1975, pp. 44--49.",{},{"id":26,"text":2445,"url":26,"identifiers":2446},"10.1145\u002F361011.361061",{"doi":2445},{"id":26,"text":2448,"url":26,"identifiers":2449},"RITCHIE , D.M. C Reference Manual. UNIX Programmer's Manual , Bell Telephone Labs , Murray Hill , N.J. , July 1974 . RITCHIE, D.M. C Reference Manual. UNIX Programmer's Manual, Bell Telephone Labs, Murray Hill, N.J., July 1974.",{},{"id":26,"text":2311,"url":26,"identifiers":2451},{"doi":2311},{"id":26,"text":2453,"url":26,"identifiers":2454},"ROTHNIE , J.B. Evaluating inter-entry retrieval expressions in a relational data base management system . Proc. AFIPS 1975 NCC , Vol. 44 , AFIPS Press, Montvale, N.J. , pp. 417 - 423 . ROTHNIE, J.B. Evaluating inter-entry retrieval expressions in a relational data base management system. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 417- 423.",{},{"id":26,"text":2319,"url":26,"identifiers":2456},{"doi":2319},{"id":26,"text":1294,"url":26,"identifiers":2458},{"doi":1294},{"id":26,"text":2460,"url":26,"identifiers":2461},"10.1145\u002F1282480.1282546",{"doi":2460},{"id":26,"text":2463,"url":26,"identifiers":2464},"Tsic~m TZ i S, D . A network framework for relational implementation. Rep. CSRG-51 , Computer Systems Research Group , U. of Toronto, Toronto, Ont., Canada, Feb. 1975 . Tsic~mTZiS, D. A network framework for relational implementation. Rep. CSRG-51, Computer Systems Research Group, U. of Toronto, Toronto, Ont., Canada, Feb. 1975.",{},{"id":2466,"createTime":2467,"updateTime":2467,"relativeEntities":2468,"slug":2469,"properties":2470,"entityType":782,"verifyStatus":25,"verifyTime":2467,"verifyNote":784,"syncStatus":28,"languages":2481,"translateLanguages":26,"viewCount":36,"primaryUrl":2482,"fullTextUrl":26,"authors":2483,"publicationType":808,"publisherRelationship":2504,"citationCount":2541,"citationInfo":2542,"publishDate":2544,"publishYear":2545,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2546,"isForceReanalyzing":952},"1d6dac41-e80d-4ddd-99bc-31e8aac6ce1a","2024-09-27T18:45:41.536+00:00",[],"A-homogeneous-relational-model-and-query-languages-for-temporal-databases",{"mag":2471,"keywords":2473,"openalex":2474,"abstract":2476,"title":2478,"doi":2480},{"VOID":2472},"2083125010",{},{"VOID":2475},"W2083125010",{"EN":2477},"\u003Cjats:p>In a temporal database, time values are associated with data item to indicate their periods of validity. We propose a model for temporal databases within the framework of the classical database theory. Our model is realized as a temporal parameterization of static relations. We do not impose any restrictions upon the schemes of temporal relations. The classical concepts of normal forms and dependencies are easily extended to our model, allowing a suitable design for a database scheme. We present a relational algebra and a tuple calculus for our model and prove their equivalence. Our data model is homogeneous in the sense that the periods of validity of all the attributes in a given tuple of a temporal relation are identical. We discuss how to relax the homogeneity requirement to extend the application domain of our approach.\u003C\u002Fjats:p>",{"EN":2479},"A homogeneous relational model and query languages for temporal databases",{"VOID":1527},[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F49346.50065",[2484],{"id":2485,"sortIndex":36,"researcher":26,"roles":2486,"affiliations":2487,"properties":2499},"57bb1f3d-cf18-433e-b74d-ee5d57b7f408",[],[2488],{"id":2489,"sortIndex":36,"affiliation":2490,"properties":26},"ceb38b27-3dd2-4973-8da2-1d8eff9c8d56",{"id":2491,"createTime":2492,"updateTime":2493,"relativeEntities":2494,"slug":2495,"properties":2496,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7eaf3cbe-b0ef-4053-b422-06bd0418d600","2024-04-06T18:19:57.719+00:00","2024-12-06T06:25:48.427+00:00",[],"Iowa-State-University-Ames",{"title":2497},{"VI":2498},"Iowa State University, Ames",{"openalex":2500,"title":2502},{"VOID":2501},"A5033341527",{"EN":2503},"Shashi K. Gadia",{"url":26,"publisher":2505,"properties":2535},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2506,"slug":663,"properties":2507,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2513,"manageAffiliations":2514,"indexDatabases":2515,"url":744,"thumbnailPath":26,"statistic":2530,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2508,"issn":2509,"introduce":2510,"eissn":2511,"title":2512},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2516,2523],{"id":726,"indexDatabase":2517,"url":741,"indexYears":26,"academicFieldIds":2522,"indexDatabaseRanking":26},{"id":728,"createTime":729,"updateTime":730,"relativeEntities":2518,"label":2519,"description":2520,"key":737,"publicationTags":2521,"standard":26},[],{"EN":733,"VI":733},{"VI":735,"EN":736},[739,740],[743],{"id":707,"indexDatabase":2524,"url":720,"indexYears":721,"academicFieldIds":2529,"indexDatabaseRanking":724},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":2525,"label":2526,"description":2527,"key":717,"publicationTags":2528,"standard":26},[],{"EN":714,"VI":714},{"EN":714,"VI":716},[719],[723],{"impactFactor":36,"impactFactorByYear":2531,"i10Index":103,"i10IndexLast5Year":36,"totalPublication":356,"totalPublicationByYear":2532,"totalCitation":748,"totalCitationByYear":2533,"totalCitationPerPublication":756,"totalCitationPerPublicationByYear":2534,"hindexLast5Year":103,"hindex":103},{"2020":114,"2021":114},{"1976":114,"1981":115,"1982":114,"1984":115,"1986":59,"1990":115,"2003":115,"2007":115,"2019":115},{"1976":750,"1981":751,"1982":752,"1984":622,"1986":248,"1990":753,"2003":754,"2007":755,"2019":50},{"1976":758,"1981":751,"1982":759,"1984":622,"1986":760,"1990":753,"2003":754,"2007":755,"2019":50},{"volume":2536,"pages":2538,"issue":2540},{"VOID":2537},"13",{"VOID":2539},"418-448",{"VOID":1914},317,{"total":2541,"publishYear":26,"statisticByYear":2543},{"2012":162,"2013":114,"2014":52,"2015":115,"2016":135,"2017":162,"2018":103,"2019":115,"2021":111,"2022":114,"2023":59,"2024":115},"1988-10-01",1988,[2547,2550,2553,2556,2559,2562,2565,2568,2571,2574,2576,2579,2582,2585,2588,2591,2594,2597,2600,2603,2606,2609,2612,2615,2618,2621,2624],{"id":26,"text":2548,"url":26,"identifiers":2549},"ANDERSON T.L., 1982, Ed. Academic Press, 273",{},{"id":26,"text":2551,"url":26,"identifiers":2552},"ARIAV G., 1983, Univ. of Pennsylvania",{},{"id":26,"text":2554,"url":26,"identifiers":2555},"ARIAV G., 1983, ACM-SIGMOD International Conference on Management of Data, 243",{},{"id":26,"text":2557,"url":26,"identifiers":2558},"BEN-ZVI J., 1982, Univ. of California",{},{"id":26,"text":2560,"url":26,"identifiers":2561},"10.1145\u002F1056176.1056180",{"doi":2560},{"id":26,"text":2563,"url":26,"identifiers":2564},"CLIFFORD J. A model for historical databases. Working Paper CRIS 47 GBA 82-76(CR) Graduate School of Business Administration New York Univ. New York.  CLIFFORD J. A model for historical databases. Working Paper CRIS 47 GBA 82-76(CR) Graduate School of Business Administration New York Univ. New York.",{},{"id":26,"text":2566,"url":26,"identifiers":2567},"CLIFFORD J. A logical framework for temporal semantics and natural language querying of historical databases. Ph.D. dissertation Dept. of Computer Science State Univ. of New York at Stony Brook Dec. 1982.   CLIFFORD J. A logical framework for temporal semantics and natural language querying of historical databases. Ph.D. dissertation Dept. of Computer Science State Univ. of New York at Stony Brook Dec. 1982.",{},{"id":26,"text":2569,"url":26,"identifiers":2570},"10.1145\u002F318898.318922",{"doi":2569},{"id":26,"text":2572,"url":26,"identifiers":2573},"10.1145\u002F319983.319986",{"doi":2572},{"id":26,"text":879,"url":26,"identifiers":2575},{"doi":879},{"id":26,"text":2577,"url":26,"identifiers":2578},"DUGUNDJI J., 1970, Boston",{},{"id":26,"text":2580,"url":26,"identifiers":2581},"10.1145\u002F6012.15406",{"doi":2580},{"id":26,"text":2583,"url":26,"identifiers":2584},"10.1145\u002F325405.325412",{"doi":2583},{"id":26,"text":2586,"url":26,"identifiers":2587},"Ingres Query Language Reference Manual. Relational Technology Jan. 1983.  Ingres Query Language Reference Manual. Relational Technology Jan. 1983.",{},{"id":26,"text":2589,"url":26,"identifiers":2590},"JONES S., 1980, Proceedings of International Conference on Databases",{},{"id":26,"text":2592,"url":26,"identifiers":2593},"10.1016\u002F0306-4379(79)90023-1",{"doi":2592},{"id":26,"text":2595,"url":26,"identifiers":2596},"KLOPPROGE M. R., 1981, Institute, 477",{},{"id":26,"text":2598,"url":26,"identifiers":2599},"KLOPPROGGE M. R., 1983, Proceedings of Ninth International Conference on Very Large Data Bases (Florence, 399",{},{"id":26,"text":2601,"url":26,"identifiers":2602},"10.1145\u002F602259.602276",{"doi":2601},{"id":26,"text":2604,"url":26,"identifiers":2605},"MAIER D., 1983, Md.",{},{"id":26,"text":2607,"url":26,"identifiers":2608},"MONTAGUE R., 1973, Approaches to Natural Languages",{},{"id":26,"text":2610,"url":26,"identifiers":2611},"10.1145\u002F588011.588041",{"doi":2610},{"id":26,"text":2613,"url":26,"identifiers":2614},"10.1145\u002F22952.22956",{"doi":2613},{"id":26,"text":2616,"url":26,"identifiers":2617},"10.1145\u002F318898.318921",{"doi":2616},{"id":26,"text":2619,"url":26,"identifiers":2620},"ULLMANN J.D., 1982, Rockville Md.",{},{"id":26,"text":2622,"url":26,"identifiers":2623},"VAZSHNAV J. H., 1984, Texas Tech",{},{"id":26,"text":2625,"url":26,"identifiers":2626},"VAN DER WAERDEN B.L. Algebra Vol. 1 Frederick Ungar New York 1970.  VAN DER WAERDEN B.L. Algebra Vol. 1 Frederick Ungar New York 1970.",{}]