{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:47Z","timestamp":1725521747785},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_34","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"366-377","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation of General Set Expressions"],"prefix":"10.1007","author":[{"given":"Ehsan","family":"Chiniforooshan","sequence":"first","affiliation":[]},{"given":"Arash","family":"Farzan","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Mirzazadeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: SODA, pp. 390\u2013399 (2002)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-77120-3_64","volume-title":"Algorithms and Computation","author":"P. Bille","year":"2007","unstructured":"Bille, P., Pagh, A., Pagh, R.: Fast evaluation of union-intersection expressions. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 739\u2013750. Springer, Heidelberg (2007)"},{"issue":"1\u20137","key":"34_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030(1\u20137), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M.R. Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A fast merging algorithm. J. ACM\u00a026(2), 211\u2013226 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M.R. Brown","year":"1980","unstructured":"Brown, M.R., Tarjan, R.E.: Design and analysis of a data structure for representing sorted lists. SIAM Journal on Computing\u00a09(3), 594\u2013614 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11523468_15","volume-title":"Automata, Languages and Programming","author":"E. Chiniforooshan","year":"2005","unstructured":"Chiniforooshan, E., Farzan, A., Mirzazadeh, M.: Worst case optimal union-intersection expression evaluation. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 179\u2013190. Springer, Heidelberg (2005)"},{"key":"34_CR7","first-page":"743","volume-title":"SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms","author":"E.D. Demaine","year":"2000","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 743\u2013752. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F.K. Hwang","year":"1972","unstructured":"Hwang, F.K., Lin, S.: A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal on Computing\u00a01(1), 31\u201339 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR10","unstructured":"Lee, G., Park, M., Won, H.: Using syntactic information in handling natural language quries for extended boolean retrieval model (1999)"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/64.577466","volume":"12","author":"M. Mauldin","year":"1997","unstructured":"Mauldin, M.: Lycos: design choices in an internet search service. IEEE Expert\u00a012(1), 8\u201311 (1997)","journal-title":"IEEE Expert"},{"key":"34_CR12","unstructured":"Mirzazadeh, M.: Adaptive comparison-based algorithms for evaluating set queries (2004)"},{"key":"34_CR13","unstructured":"Pugh, W.: A skip list cookbook. Tech. rep., University of Maryland at College Park, College Park, MD, USA (1990)"},{"key":"34_CR14","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, San Francisco (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T10:33:24Z","timestamp":1551695604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}