{"id":"https://openalex.org/W10027119","doi":null,"title":"Data Mining Query Scheduling for Apriori Common Counting","display_name":"Data Mining Query Scheduling for Apriori Common Counting","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W10027119","mag":"10027119"},"language":"en","primary_location":{"id":"mag:10027119","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.put.poznan.pl/mzakrzewicz/pubs/dbis04.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045353752","display_name":"Marek Wojciechowski","orcid":"https://orcid.org/0000-0001-5953-1154","observed_orcids":["https://orcid.org/0000-0001-5953-1154"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marek Wojciechowski","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5953-1154","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049316348","display_name":"Maciej Zakrzewicz","orcid":"https://orcid.org/0000-0002-1995-6294","observed_orcids":["https://orcid.org/0000-0002-1995-6294"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maciej Zakrzewicz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1995-6294","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6696,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86447413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.49709999561309814,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.49709999561309814,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.48510000109672546,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.0019000000320374966,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/apriori-algorithm","display_name":"Apriori algorithm","score":0.9380000233650208},{"id":"https://openalex.org/keywords/i-o-cost-reduction","display_name":"I/O cost reduction","score":0.9369999766349792},{"id":"https://openalex.org/keywords/memory-management","display_name":"memory management","score":0.46299999952316284},{"id":"https://openalex.org/keywords/heuristic-scheduling-algorithm","display_name":"heuristic scheduling algorithm","score":0.8270000219345093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8309001326560974},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.7066548466682434},{"id":"https://openalex.org/C89198739","wikidata":"https://www.wikidata.org/wiki/Q3079880","display_name":"Data stream mining","level":2,"score":0.6164786219596863},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.540062427520752},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4751436710357666},{"id":"https://openalex.org/C135572916","wikidata":"https://www.wikidata.org/wiki/Q193351","display_name":"Data warehouse","level":2,"score":0.4169190526008606},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3613491654396057},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3516573905944824},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:10027119","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.put.poznan.pl/mzakrzewicz/pubs/dbis04.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W45278777","https://openalex.org/W54446695","https://openalex.org/W198504919","https://openalex.org/W1484413656","https://openalex.org/W1524454721","https://openalex.org/W1539916429","https://openalex.org/W1561102686","https://openalex.org/W1597561788","https://openalex.org/W1823359145","https://openalex.org/W1972873066","https://openalex.org/W2052629503","https://openalex.org/W2114624736","https://openalex.org/W2122415346","https://openalex.org/W2134419643","https://openalex.org/W2166559705","https://openalex.org/W2403358879"],"related_works":["https://openalex.org/W7095079010","https://openalex.org/W2583696736","https://openalex.org/W72136294","https://openalex.org/W7095641745","https://openalex.org/W7096704991","https://openalex.org/W1496309030","https://openalex.org/W1587408068","https://openalex.org/W2583276228","https://openalex.org/W7100321524","https://openalex.org/W7100743237"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"concurrent":[5],"execution":[6],"of":[7,21,77,85],"multiple":[8,75],"data":[9,14,35,43,65,86,99],"mining":[10,15,44,66,87,100],"queries.":[11],"If":[12,54],"such":[13],"queries":[16,45,70,101],"operate":[17],"on":[18],"similar":[19],"parts":[20],"the":[22,51,55,64,69,83,98],"database,":[23],"then":[24,68],"their":[25,34],"overall":[26],"I/O":[27],"cost":[28],"can":[29],"be":[30,72],"reduced":[31],"by":[32],"integrating":[33],"retrieval":[36],"operations.":[37],"The":[38],"integration":[39],"requires":[40],"that":[41],"many":[42],"are":[46],"present":[47],"in":[48],"memory":[49,56],"at":[50],"same":[52],"time.":[53],"size":[57],"is":[58],"not":[59],"sufficient":[60],"to":[61,95],"hold":[62],"all":[63],"queries,":[67],"must":[71],"scheduled":[73],"into":[74,102],"phases":[76],"loading":[78],"and":[79,90],"processing.":[80],"We":[81],"discuss":[82],"problem":[84],"query":[88],"scheduling":[89],"propose":[91],"a":[92],"heuristic":[93],"algorithm":[94],"efficiently":[96],"schedule":[97],"phases.":[103]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2016-06-24T00:00:00"}