{"id":"https://openalex.org/W1998446171","doi":"https://doi.org/10.1145/2007052.2007078","title":"Complexity study on \"Carry-along Sort\" algorithm","display_name":"Complexity study on \"Carry-along Sort\" algorithm","publication_year":2011,"publication_date":"2011-07-21","ids":{"openalex":"https://openalex.org/W1998446171","doi":"https://doi.org/10.1145/2007052.2007078","mag":"1998446171"},"language":"en","primary_location":{"id":"doi:10.1145/2007052.2007078","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2007052.2007078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Advances in Computing and Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5082969911","display_name":"Prabhakaran Sethuraman","orcid":"https://orcid.org/0000-0003-2089-8201"},"institutions":[{"id":"https://openalex.org/I180507071","display_name":"Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya","ror":"https://ror.org/04w713f83","country_code":"IN","type":"education","lineage":["https://openalex.org/I180507071"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prabhakaran Sethuraman","raw_affiliation_strings":["SCSVMV University, Enathur, Kanchipuram, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SCSVMV University, Enathur, Kanchipuram, India","institution_ids":["https://openalex.org/I180507071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053811814","display_name":"Lakshmi Rajamani","orcid":null},"institutions":[{"id":"https://openalex.org/I8975392","display_name":"Osmania University","ror":"https://ror.org/030sjb889","country_code":"IN","type":"education","lineage":["https://openalex.org/I8975392"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Lakshmi Rajamani","raw_affiliation_strings":["Osmania University, Hyderabad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osmania University, Hyderabad, India","institution_ids":["https://openalex.org/I8975392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1157863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9983999729156494,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9983999729156494,"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/sort","display_name":"sort","score":0.862677812576294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7876284122467041},{"id":"https://openalex.org/keywords/carry","display_name":"Carry (investment)","score":0.7320614457130432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5691760182380676},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5201818943023682},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5064259767532349},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.495536208152771},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.48948776721954346},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45236465334892273},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4270189106464386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4250665307044983},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16267427802085876}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.862677812576294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7876284122467041},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.7320614457130432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5691760182380676},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5201818943023682},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5064259767532349},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.495536208152771},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.48948776721954346},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45236465334892273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4270189106464386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4250665307044983},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16267427802085876},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2007052.2007078","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2007052.2007078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Advances in Computing and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W90118906","https://openalex.org/W180687025","https://openalex.org/W1512117635","https://openalex.org/W1570131048","https://openalex.org/W2044399674","https://openalex.org/W2108007407","https://openalex.org/W2108204304","https://openalex.org/W2125678378","https://openalex.org/W2126254530","https://openalex.org/W2141938450","https://openalex.org/W2282583353","https://openalex.org/W3021133423","https://openalex.org/W3157313818","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2350549588","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W3206496585","https://openalex.org/W2187267622","https://openalex.org/W3002909018","https://openalex.org/W3134175203"],"abstract_inverted_index":{"Hierarchy":[0],"generation":[1],"is":[2,32,37,45,87],"the":[3,33,46,59,74,93,126],"very":[4],"familiar":[5],"and":[6,43,70,105],"evolving":[7],"concept":[8],"in":[9,66],"Relational":[10],"database":[11],"management":[12],"system.":[13],"There":[14],"are":[15,55,102],"so":[16,72],"many":[17],"methods":[18],"currently":[19],"available":[20],"to":[21,39,57,113,132],"generate":[22,40],"as":[23,115],"well":[24],"manage":[25],"hierarchies.":[26],"But,":[27],"carry":[28],"along":[29],"sort":[30],"algorithm":[31,78,131],"new":[34],"method":[35],"which":[36,100],"used":[38],"hierarchies":[41],"dynamically":[42],"it":[44],"subset":[47],"of":[48,68,76,95,99,128],"materialized":[49],"path.":[50],"In":[51],"this":[52,77],"paper,":[53],"we":[54,116],"going":[56],"perform":[58],"complexity":[60],"study":[61,120],"against":[62],"\"Carry-along":[63],"Sort\"":[64],"Algorithm":[65],"terms":[67],"time":[69,103,127],"space":[71,109],"that":[73],"efficiency":[75],"can":[79],"be":[80],"compared":[81],"with":[82],"other":[83],"existing":[84],"methods.":[85],"Complexity":[86,119],"about":[88,92],"performance":[89],"measures,":[90],"NOT":[91],"intricacy":[94],"programs.":[96],"The":[97],"choice":[98],"operations":[101],"critical":[104],"what":[106],"constitutes":[107],"a":[108,122,134],"cell":[110],"varies":[111],"according":[112],"application,":[114],"shall":[117],"see.":[118],"plays":[121],"vital":[123],"role":[124],"at":[125],"choosing":[129],"an":[130],"solve":[133],"given":[135],"problem.":[136]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}