{"id":"https://openalex.org/W2152840937","doi":"https://doi.org/10.1109/ssdm.2003.1214954","title":"Space constrained selection problems for data warehouses and pervasive computing","display_name":"Space constrained selection problems for data warehouses and pervasive computing","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W2152840937","doi":"https://doi.org/10.1109/ssdm.2003.1214954","mag":"2152840937"},"language":"en","primary_location":{"id":"doi:10.1109/ssdm.2003.1214954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssdm.2003.1214954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"15th International Conference on Scientific and Statistical Database Management, 2003.","raw_type":"proceedings-article"},"type":"article","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/A5053726723","display_name":"Themis Palpanas","orcid":"https://orcid.org/0000-0002-8031-0265"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. Palpanas","raw_affiliation_strings":["University of California, Riverside, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032833518","display_name":"N. Kouda","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Kouda","raw_affiliation_strings":["AT&T labs - Research"],"affiliations":[{"raw_affiliation_string":"AT&T labs - Research","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004768561","display_name":"Alberto O. Mendelzon","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"id":"https://openalex.org/I4210099137","display_name":"Research Canada","ror":"https://ror.org/0103eqz62","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210099137"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"A. Mendelzon","raw_affiliation_strings":["AT & T Labs-Research","AT & T Labs-Research, Canada"],"affiliations":[{"raw_affiliation_string":"AT & T Labs-Research","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT & T Labs-Research, Canada","institution_ids":["https://openalex.org/I4210099137"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053726723"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.24538259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"220","issue":null,"first_page":"55","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9958999752998352,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.7678236961364746},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6176853775978088},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5913518071174622},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5254582166671753},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5039543509483337},{"id":"https://openalex.org/keywords/data-warehouse","display_name":"Data warehouse","score":0.4929940402507782},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49135175347328186},{"id":"https://openalex.org/keywords/ubiquitous-computing","display_name":"Ubiquitous computing","score":0.4898390471935272},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45538806915283203},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.25638046860694885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18089142441749573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1390567421913147}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7678236961364746},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6176853775978088},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5913518071174622},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5254582166671753},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5039543509483337},{"id":"https://openalex.org/C135572916","wikidata":"https://www.wikidata.org/wiki/Q193351","display_name":"Data warehouse","level":2,"score":0.4929940402507782},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49135175347328186},{"id":"https://openalex.org/C172195944","wikidata":"https://www.wikidata.org/wiki/Q541265","display_name":"Ubiquitous computing","level":2,"score":0.4898390471935272},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45538806915283203},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25638046860694885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18089142441749573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1390567421913147},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ssdm.2003.1214954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssdm.2003.1214954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"15th International Conference on Scientific and Statistical Database Management, 2003.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.538.6910","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.538.6910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://disi.unitn.it/~themis/publications/ssdbm03.pdf","raw_type":"text"},{"id":"pmh:oai:iris.unitn.it:11572/75360","is_oa":false,"landing_page_url":"http://hdl.handle.net/11572/75360","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1482520531","https://openalex.org/W1508412218","https://openalex.org/W1522055873","https://openalex.org/W1538267625","https://openalex.org/W1565838812","https://openalex.org/W1581805425","https://openalex.org/W1988837529","https://openalex.org/W2001352309","https://openalex.org/W2017782374","https://openalex.org/W2024060531","https://openalex.org/W2039795745","https://openalex.org/W2081579241","https://openalex.org/W2111845378","https://openalex.org/W2112056262","https://openalex.org/W2113723748","https://openalex.org/W2114679600","https://openalex.org/W2114712170","https://openalex.org/W2119430004","https://openalex.org/W2119849793","https://openalex.org/W2128193809","https://openalex.org/W2160677885","https://openalex.org/W2172028276","https://openalex.org/W2295815851","https://openalex.org/W2339500526","https://openalex.org/W3186546642","https://openalex.org/W4212899374","https://openalex.org/W4245927080","https://openalex.org/W4289258943","https://openalex.org/W6628941440","https://openalex.org/W6631144357","https://openalex.org/W6632424119","https://openalex.org/W6634765471","https://openalex.org/W6655000594","https://openalex.org/W6678127726","https://openalex.org/W6684915226"],"related_works":["https://openalex.org/W3173606202","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":{"Space":[0],"constrained":[1],"optimization":[2],"problems":[3,23,108,206],"arise":[4],"in":[5,75,86,109,183,193,203],"a":[6,27,35,52,55,100,150,173],"multitude":[7],"of":[8,21,29,31,59,82,106,112,143,154,160,167,176,207],"important":[9,77],"applications":[10,202],"such":[11,22,107],"as":[12],"data":[13,113],"warehouses":[14],"and":[15,94,116,122,145,164,198],"pervasive":[16,117],"computing.":[17],"A":[18],"typical":[19],"instance":[20],"is":[24,49,97],"to":[25,34,63,200],"select":[26],"set":[28,96],"items":[30,90],"interest,":[32],"subject":[33],"constraint":[36],"on":[37],"the":[38,65,69,88,110,141,155,158,161,165,177,188,194],"total":[39,66],"space":[40],"occupied":[41],"by":[42],"these":[43,137],"items.":[44,71],"Assuming":[45],"that":[46,74],"each":[47,95,168],"item":[48],"associated":[50,98],"with":[51,99],"benefit,":[53,60],"for":[54,68,126,136,185],"suitably":[56],"defined":[57],"notion":[58],"one":[61,79],"wishes":[62],"optimize":[64],"benefit":[67,101],"selected":[70],"We":[72,103,148],"show":[73],"many":[76,204],"applications,":[78],"faces":[80],"variants":[81],"this":[83],"basic":[84],"problem":[85],"which":[87,179],"individual":[89],"are":[91,131,196],"sets":[92],"themselves,":[93],"value.":[102],"present":[104,149,172],"instances":[105],"context":[111],"warehouse":[114],"management":[115],"computing,":[118],"derive":[119],"their":[120],"complexity,":[121],"propose":[123],"several":[124],"techniques":[125],"solving":[127],"them.":[128],"Since":[129],"there":[130],"no":[132],"known":[133],"approximation":[134],"algorithms":[135],"problems,":[138],"we":[139,171],"explore":[140],"use":[142],"greedy":[144],"randomized":[146],"techniques.":[147],"detailed":[151],"performance":[152],"study":[153],"algorithms,":[156,178],"highlighting":[157],"efficiency":[159],"proposed":[162,192],"solutions":[163,191],"benefits":[166],"approach.":[169],"Finally,":[170],"worst-case":[174],"analysis":[175],"can":[180],"be":[181],"useful":[182],"practice":[184],"choosing":[186],"among":[187],"alternatives.":[189],"The":[190],"paper":[195],"generic":[197],"likely":[199],"find":[201],"more":[205],"interest":[208],"than":[209],"those":[210],"mentioned":[211],"above.":[212]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}