{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T03:33:58Z","timestamp":1777952038394,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"vor","delay-in-days":30,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1016\/j.procs.2026.01.045","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:30:19Z","timestamp":1774035019000},"page":"369-376","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Querying Structured Objects via Alignment-Oriented Retrieval Method"],"prefix":"10.1016","volume":"275","author":[{"given":"Owais","family":"Waheed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2026.01.045_bib1","doi-asserted-by":"crossref","unstructured":"P. B. Chen, Y. Zhang, M. Cafarella, and D. Roth, \u201cCan we Retrieve Everything All at Once? ARM: An Alignment-Oriented LLM-based Retrieval Method,\u201d arXiv:2501.18539, 2025.","DOI":"10.18653\/v1\/2025.acl-long.1463"},{"key":"10.1016\/j.procs.2026.01.045_bib2","series-title":"\u201cOkapi at TREC-3,\u201d in Proc. 3rd Text REtrieval Conf","author":"Robertson","year":"1995"},{"key":"10.1016\/j.procs.2026.01.045_bib3","doi-asserted-by":"crossref","unstructured":"S. Robertson, \u201cThe Probabilistic Relevance Framework: BM25 and Beyond,\u201d Found. Trends Inf. Retr., 2009.","DOI":"10.1561\/1500000019"},{"key":"10.1016\/j.procs.2026.01.045_bib4","unstructured":"E. Voorhees and D. Harman, \u201cTREC: Experiment and Evaluation in Information Retrieval,\u201d MIT Press, 2005."},{"key":"10.1016\/j.procs.2026.01.045_bib5","doi-asserted-by":"crossref","unstructured":"C. D. Manning, P. Raghavan, and H. Sch\u00fctze, Introduction to Information Retrieval, Cambridge Univ. Press, 2008.","DOI":"10.1017\/CBO9780511809071"},{"key":"10.1016\/j.procs.2026.01.045_bib6","series-title":"\u201cDense Passage Retrieval for Open-Domain Question Answering,\u201d in Proc","author":"Karpukhin","year":"2020"},{"key":"10.1016\/j.procs.2026.01.045_bib7","series-title":"\u201cSentence-BERT: Sentence Embeddings using Siamese BERT-Networks,\u201d in Proc","author":"Reimers","year":"2019"},{"key":"10.1016\/j.procs.2026.01.045_bib8","series-title":"\u201cBillion-Scale Similarity Search with GPUs,\u201d IEEE Trans","author":"Johnson","year":"2019"},{"key":"10.1016\/j.procs.2026.01.045_bib9","series-title":"\u201cApproximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval,\u201d in Proc","author":"Xiong","year":"2021"},{"key":"10.1016\/j.procs.2026.01.045_bib10","series-title":"\u201cCOIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List,\u201d in Proc","author":"Gao","year":"2021"},{"key":"10.1016\/j.procs.2026.01.045_bib11","series-title":"\u201cBEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models,\u201d in Proc","author":"Thakur","year":"2021"},{"key":"10.1016\/j.procs.2026.01.045_bib12","series-title":"\u201cLeveraging Passage Retrieval with Generative Models,\u201d in Proc","author":"Izacard","year":"2021"},{"key":"10.1016\/j.procs.2026.01.045_bib13","doi-asserted-by":"crossref","unstructured":"F. Zhao, Z. Tian, and H. Jin, \u201cEntity-Based Language Model Smoothing Approach for Smart Search,\u201d IEEE Access, vol. 6, pp. 9991-10002, 2018.","DOI":"10.1109\/ACCESS.2017.2788417"},{"key":"10.1016\/j.procs.2026.01.045_bib14","unstructured":"H. Wu, Y. Yuan, L. Mikaelyan, A. Meulemans, X. Liu, J. Hensman, and B. Mitra, \u201cStructured Entity Extraction Using Large Language Models,\u201d arXiv preprint arXiv:2402.04437v3, 2024."},{"key":"10.1016\/j.procs.2026.01.045_bib15","series-title":"\u201cStructured Retrieval for Large-Scale Knowledge Graphs,\u201d in Proc","author":"Cai","year":"2023"},{"key":"10.1016\/j.procs.2026.01.045_bib16","series-title":"\u201cRetrieval-Augmented Generation for Knowledge-Intensive NLP Tasks,\u201d in Proc","author":"Lewis","year":"2020"},{"key":"10.1016\/j.procs.2026.01.045_bib17","series-title":"\u201cREALM: Retrieval-Augmented Language Model Pre-Training,\u201d in Proc","author":"Guu","year":"2020"},{"key":"10.1016\/j.procs.2026.01.045_bib18","series-title":"\u201cNovelty and Diversity in Information Retrieval Evaluation,\u201d in Proc","author":"Clarke","year":"2008"},{"key":"10.1016\/j.procs.2026.01.045_bib19","doi-asserted-by":"crossref","unstructured":"A. Moffat and J. Zobel, \u201cRank-Biased Precision for Measurement of Retrieval Effectiveness,\u201d ACM TOIS, 2008.","DOI":"10.1145\/1416950.1416952"},{"key":"10.1016\/j.procs.2026.01.045_bib20","series-title":"\u201cThe Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries,\u201d in Proc","author":"Carbonell","year":"1998"},{"key":"10.1016\/j.procs.2026.01.045_bib21","doi-asserted-by":"crossref","unstructured":"K. Balog, Entity-Oriented Search, Springer, 2018.","DOI":"10.1007\/978-3-319-93935-3"},{"key":"10.1016\/j.procs.2026.01.045_bib22","unstructured":"Proxycurl LLC, \u201cLinkedIn dataset\u201310,000 US people profiles (Full People Profiles of 10,000 people in US),\u201d Kaggle Dataset, Proxycurl, 2021. Available: https:\/\/www.kaggle.com\/datasets\/proxycurl\/10000-us-people-profiles."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926000451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050926000451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:22:39Z","timestamp":1777893759000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050926000451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":22,"alternative-id":["S1877050926000451"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2026.01.045","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Querying Structured Objects via Alignment-Oriented Retrieval Method","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2026.01.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}