{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T21:46:10Z","timestamp":1724708770827},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T00:00:00Z","timestamp":1386633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s11227-013-1058-9","type":"journal-article","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T04:47:13Z","timestamp":1386564433000},"page":"672-708","source":"Crossref","is-referenced-by-count":5,"title":["Particle swarm optimization for bitmap join indexes selection problem in data warehouses"],"prefix":"10.1007","volume":"68","author":[{"given":"Lyazid","family":"Toumi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelouahab","family":"Moussaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmet","family":"Ugur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,10]]},"reference":[{"key":"1058_CR1","volume-title":"The data warehouse toolkit: the complete guide to dimensional modeling","author":"R Kimball","year":"2002","unstructured":"Kimball R, Ross M (2002) The data warehouse toolkit: the complete guide to dimensional modeling, 2nd edn. Wiley, New York","edition":"2"},{"issue":"1","key":"1058_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P Mishra","year":"1992","unstructured":"Mishra P, Eich M (1992) Join processing in relational databases. ACM Comput Surv 24(1):63\u2013113","journal-title":"ACM Comput Surv"},{"key":"1058_CR3","doi-asserted-by":"crossref","unstructured":"O\u2019Neil P, Quass D (1997) Improved query performance with variant indexes. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 38\u201349","DOI":"10.1145\/253262.253268"},{"key":"1058_CR4","unstructured":"Sanjay A, Surajit C, Narasayya VR (2000) Automated selection of materialized views and indexes in microsoft sql server. In: Proceedings of VLDB, pp 496\u2013505"},{"key":"1058_CR5","unstructured":"Zilio DC, Rao J, Lightstone S et al (2004) Db2 design advisor: integrated automatic physical database design. In: Proceedings of VLDB, pp 1087\u20131097"},{"issue":"3","key":"1058_CR6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/211990.212001","volume":"24","author":"P O\u2019Neil","year":"1995","unstructured":"O\u2019Neil P, Graefe G (1995) Multi-table joins through bitmapped join indices. ACM SIGMOD Rec 24(3):8\u201311","journal-title":"ACM SIGMOD Rec"},{"key":"1058_CR7","unstructured":"Johnson T (1999) Performance measurements of compressed bitmap indices. In: Proceedings of the international conference on very large databases, pp 278\u2013289"},{"key":"1058_CR8","doi-asserted-by":"crossref","unstructured":"Madduri K, Wu K (2009), Efficient joins with compressed bitmap indexes. In: Proceedings of the 18th ACM conference on information and, knowledge management, pp 1017\u20131026","DOI":"10.1145\/1645953.1646083"},{"issue":"1","key":"1058_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.datak.2009.08.006","volume":"69","author":"D Lemire","year":"2010","unstructured":"Lemire D, Kaser O, Aouiche K (2010) Sorting improves word-aligned bitmap indexes. Data Knowl Eng 69(1):3\u201328","journal-title":"Data Knowl Eng"},{"key":"1058_CR10","doi-asserted-by":"crossref","unstructured":"Kratica J, Ljubic I, Tosic D (2003) A genetic algorithm for the index selection problem. In: Proceedings of EvoWorkshops\u201903: the 2003 international conference on applications of evolutionary, computing, pp 280\u2013290","DOI":"10.1007\/3-540-36605-9_26"},{"issue":"4","key":"1058_CR11","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1145\/320289.320296","volume":"3","author":"D Comer","year":"1978","unstructured":"Comer D (1978) The difficulty of optimum index selection. ACM Trans Database Syst 3(4):440\u2013445","journal-title":"ACM Trans Database Syst"},{"key":"1058_CR12","volume-title":"Principles of distributed database systems","author":"MT Ozsu","year":"1999","unstructured":"Ozsu MT, Valduriez P (1999) Principles of distributed database systems, 2nd edn. Prentice Hall, New Jersey","edition":"2"},{"issue":"11","key":"1058_CR13","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1109\/TKDE.2004.75","volume":"16","author":"S Chaudhuri","year":"2004","unstructured":"Chaudhuri S (2004) Index selection for databases: a hardness study and a principle heuristic solution. IEEE Trans Knowl Data Eng 16(11):1313\u20131323","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1058_CR14","doi-asserted-by":"crossref","unstructured":"Aouiche K, Boussaid O, Bentayeb F (2005) Automatic selection of bitmap join indexes in data warehouses. In: Proceedings of international conference on data warehousing and knowledge discovery, pp 64\u201373","DOI":"10.1007\/11546849_7"},{"issue":"2","key":"1058_CR15","first-page":"206","volume":"1","author":"L Bellatreche","year":"2008","unstructured":"Bellatreche L, Missaoui R, Necir H et al (2008) A data mining approach for selecting bitmap join indices. J Comput Sci Eng 1(2):206\u2013223","journal-title":"J Comput Sci Eng"},{"issue":"3","key":"1058_CR16","first-page":"177","volume":"2","author":"N Hamid","year":"2010","unstructured":"Hamid N (2010) A data mining approach for efficient selection bitmap join index. Int J Data Min Model Manag 2(3):177\u2013194","journal-title":"Int J Data Min Model Manag"},{"key":"1058_CR17","doi-asserted-by":"crossref","unstructured":"Bouchakri R, Bellatreche L (2011) On simplifying integrated physical database design. In: Proceedings of 15th international conference ADBIS 2011, pp 333\u2013346","DOI":"10.1007\/978-3-642-23737-9_24"},{"key":"1058_CR18","doi-asserted-by":"crossref","unstructured":"Gacem A, Boukhalfa K (2012) Immune algorithm for bitmap join indexes. In: Proceedings of international conference ICONIP, pp 560\u2013567","DOI":"10.1007\/978-3-642-34487-9_68"},{"key":"1058_CR19","doi-asserted-by":"crossref","unstructured":"Bellatreche L, Boukhalfa K (2010) Yet another algorithms for selecting bitmap join indexes. In: Proceedings of international conference DaWaK, pp 105\u2013116","DOI":"10.1007\/978-3-642-15105-7_9"},{"issue":"3","key":"1058_CR20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s007780050040","volume":"6","author":"M Steinbrunn","year":"1997","unstructured":"Steinbrunn M, Moerkotte G, Kemper A (1997) Heuristic and randomized optimization for the join ordering problem. VLDB J 6(3):191\u2013208","journal-title":"VLDB J"},{"key":"1058_CR21","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"1058_CR22","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"key":"1058_CR23","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of IEEE international conference on systems, man, and cybernetics, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"1058_CR24","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"R Garey","year":"1979","unstructured":"Garey R, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco"},{"key":"1058_CR25","unstructured":"APB-I, OLAP Benchmark (1998) Release II, OLAP Council. http:\/\/www.olapcouncil.org\/"},{"key":"1058_CR26","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference evolutionary computation, pp 4\u20139","DOI":"10.1109\/ICEC.1998.699146"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1058-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-1058-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1058-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T13:39:55Z","timestamp":1564925995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-1058-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,10]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1058"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-1058-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,10]]}}}