@article {789,
	title = {Query Expansion in Text Information Retrieval with Local Context and Distributional Model-},
	journal = {Journal of Digital Information Management},
	volume = {17},
	year = {2020},
	month = {12/2019},
	pages = {313-320},
	type = {Research},
	chapter = {313},
	abstract = {<p>The Semantic Distributional Model is based on the frequency of contexts of use of language terms in large open corpus such as the web, to establish similarity or the relationship between words. These relationships or similarities can be used to add terms when expanding queries. The idea explored in this paper is that, for queries in closed collections of text documents, a posterior filter based on the restricted vocabulary of the collection can improve the effectiveness of automatic query expansion. This idea is developed and evaluated in publicly available benchmarks presenting promising results.</p>
},
	doi = {https://doi.org/10.6025/jdim/2019/17/6/313-320},
	url = {http://dline.info/fpaper/jdim/v17i6/jdimv17i6_1.pdf},
	author = {Fabiano Tavares da Silva and Jos{\'e} E. B. Maia}
}
@article {832,
	title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval {\textendash}},
	journal = {Journal of Digital Information Management},
	volume = {16},
	year = {2018},
	month = {04/2018},
	pages = {86-98},
	type = {Research},
	chapter = {85},
	abstract = {<p>The aim of this paper is to improve the search query performance of the biomedical literature by expanding the queries with most significant terms. Methods: In this article, an enhanced BM25 mathematical approach is proposed to retrieve the most query relevant literature from clustered Biomedical literature bank with query expansion from MeSH. The clustered biomedical topics are analyzed with different pre-processing methods and term-weighting functions and found the best values for the tuning parameters K1, b, K3 and the right combination of pre-processing and term weighting functions for improving the query performance in terms of Average Precision, Mean Average Precision and R-precision. Novelty/Improvements: In this approach, the existing best match retrieval technique is normalized with the calibrate constants K1 = 1.3, b = 0.75, K3 = 1.2 and the significant terms are identified with comparison of MeSH for query expansion. The retrieval performance is improved in terms of Mean Average Precision and R-precision</p>
},
	url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_4.pdf},
	author = {ThayyabaKhatoon MD and A. Govardhan}
}
@article {654,
	title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval},
	journal = {Journal of Digital Information Management},
	volume = {16},
	year = {2018},
	month = {04/2018},
	pages = {85-98},
	type = {Research},
	author = {ThayyabaKhatoon MD and A. Govardhan}
}
@article {675,
	title = {Query Optimization on Distributed Health Database DBD by Minimizing Attribute Involvement},
	journal = {Journal of Digital Information Management},
	volume = {16},
	year = {2018},
	month = {06/2018},
	pages = {105-113},
	type = {Research},
	author = {Slamet Sudaryanto N and Sudaryanto and Maryani S}
}
@article {288,
	title = {Querying and ranking xml documents based on data synopses},
	journal = {Journal of Digital Information Management},
	volume = {9},
	year = {2011},
	note = {Export Date: 10 July 2014},
	month = {2011},
	pages = {199 - 205},
	abstract = {There is an increasing interest in recent years for querying and ranking XML documents. In this paper, we present a new framework for querying and ranking schema-less XML documents based on concise summaries of their structural and textual content. We introduce a novel data synopsis structure to summarize the textual content of an XML document for efficient indexing. More importantly, we extend the traditional vector space model to effectively rank XML documents over the proposed data synopses. We conduct extensive experiments over XML benchmark data to demonstrate the advantages of the indexing scheme and the effectiveness of our ranking scheme. We also compare our framework with Lucene to demonstrate our extended TF*IDF scoring function is effective.},
	keywords = {Document ranking, Query processing, Query synopses, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855362331\&partnerID=40\&md5=85a8a3de60a877da1d0a3495eaf27e22},
	author = {He, W. and Lv, T.}
}
@article {229,
	title = {Qos-aware selection of web service compositions using Harmony Search algorithm},
	journal = {Journal of Digital Information Management},
	volume = {8},
	year = {2010},
	note = {Cited By (since 1996):4Export Date: 10 July 2014},
	month = {2010},
	pages = {160 - 166},
	abstract = {Extensive use of web services has lead to introduce web service compositions to execute business workfiows. Since several function equivalent services, provided by different service providers, may be available in the Web, the problem of selection of web service compositions arises. QoS aware selection means considering the quality of the service composition in choosing constituent services. So a method is needed for computing the quality of a composition and determining the composition with the (almost) best quality. The resulting composite has optimal quality and satisfies user{\textquoteright}s quality constraints. In this paper, the problem of QoS aware selection of web service composition is modeled as an optimization problem. Then a variation of Harmony Search algorithm is used to find a near optimal composition. Harmony Search is a recently developed optimization algorithm that mimics the improvisation process. The proposed method based on Harmony Search has been applied to a large variety of composition schemas, generated by a simulation software, and the results show that the proposed method works faster, compared with other approaches.},
	keywords = {Global optimization, Harmony Search algorithm, Quality-of-service, Web service composition, Workflow},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960212292\&partnerID=40\&md5=8b2aa95f15cbf2d77baea346d4870d04},
	author = {Jafarpour, N. and Khayyambashi, M.R.}
}
@article {228,
	title = {A query-oriented XML fragment search approach on a relational database system},
	journal = {Journal of Digital Information Management},
	volume = {8},
	year = {2010},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2010},
	pages = {175 - 180},
	abstract = {In this paper, we propose a query-oriented fragment search approach for efficient and effective XML search engines on relational database systems. Conventional approaches for XML fragment search have only considered statistics of XML documents stored in a database system to rank a search result. As a result, almost all XML fragment search engines have attained negative results in the research field of information retrieval (IR). To cope with this problem, considering not only statistics in the database system but also ones extracted from a query helps to improve retrieval accuracy of XML fragment search engines; however, it is also faced with a problem related with their efficiencies. Therefore, we have to devise ways of achieving both highly-relevant search results and efficient query processing. We implemented our XML search engine adopting the query-oriented fragment search approach, and found that it allows users to search XML fragments more accurately and effectively than conventional ones on our XML search engine.},
	keywords = {Efficient and effective, RDB, Scoring method for XML fragments, XML search engine},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79956028452\&partnerID=40\&md5=42415d9f4c5aca4c312c791ecc719adb},
	author = {Keyaki, A. and Hatano, K. and Miyazaki, J.}
}
@article {167,
	title = {A query answering surveillance system for detecting and tracking moving objects using bounding rectangles},
	journal = {Journal of Digital Information Management},
	volume = {7},
	year = {2009},
	note = {Export Date: 10 July 2014},
	month = {2009},
	pages = {15 - 20},
	abstract = {In many computer vision applications such as surveillance systems, detecting moving objects is the first step of information extraction. This paper introduces a query answering system that aims at responding to user queries without the need to scan the whole video tape. the proposed system is based on finding the minimum boundary rectangles (MBRs) of moving objects which appear in the video. It detects moving objects in the video frame set, keeps track of those objects, and saves information to answer future queries.},
	keywords = {Background subtraction, MBR, Object tracking, Rgb difference, Surveillance system},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350676981\&partnerID=40\&md5=bf39ff54dd637a3f58625643a68ed65a},
	author = {Sleit, A. and Almobaideen, W. and Qatawneh, M. and Barakat, A. and Saadeh, H.}
}
@article {188,
	title = {Query-by-multiple-examples using support vector machines},
	journal = {Journal of Digital Information Management},
	volume = {7},
	year = {2009},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2009},
	pages = {202 - 210},
	abstract = {We identify and explore an Information Retrieval paradigm called Query-By-Multiple-Examples (QBME) where the information need is described not by a set of terms but by a set of documents. Intuitive ideas for QBME include using the centroid of these documents or the well-known Rocchio algorithm to construct the query vector. We consider this problem from the perspective of text classification, and find that a better query vector can be obtained through learning with Support Vector Machines (SVMs). For online queries, we show how SVMs can be learned from one-class examples in linear time. For offline queries, we show how SVMs can be learned from positive and unlabeled examples together in linear or polynomial time, optimising some meaningful multivariate performance measures. The effectiveness and efficiency of the proposed approaches have been confirmed by our experiments on four real-world datasets.},
	keywords = {Information retrieval, Machine learning, Supportvector machine, Text classification},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953247724\&partnerID=40\&md5=8fea0823a5d70e478bf228f315a5ef89},
	author = {Zhang, D. and Lee, W.S.}
}
@article {145,
	title = {Query planning in the PORDaS P2P database system},
	journal = {Journal of Digital Information Management},
	volume = {6},
	year = {2008},
	note = {Export Date: 10 July 2014},
	month = {2008},
	pages = {307 - 314},
	abstract = {Computational science is a rapidly growing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our research, we see the peer-to-peer (P2P) paradigm a possible solution to some of the problems in distributed data management. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.},
	keywords = {Data grid, Distributed databases, Peer-to-peer, Query processing},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902\&partnerID=40\&md5=ac29e0f628f2878d089fa8c43f3eb0de},
	author = {N{\o}rv{\r a}g, K. and Eide, E. and Standal, O.H.}
}
@article {91,
	title = {Querying unstructured and structured peer-to-peer networks: Models, issues, algorithms},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Export Date: 10 July 2014},
	month = {2007},
	pages = {201 - 210},
	abstract = {Peer-to-Peer (P2P) networks are defined as a collection of peers that expose client/server functionalities simultaneously. P2P systems, built on top of P2P networks, support information sharing primitives and lookup mechanisms of data objects located on peers. It has been demonstrated that the P2P paradigm is able to efficiently capture models and, above all, dynamics of modem applications, beyond limitations of conventional produce/consumer paradigms. Traditionally, P2P primitives and mechanisms have been implemented by means of keyword-based search and matching operations. Modern P2P systems require more complex query functionalities, beyond capabilities of DBMS-inspired models and algorithms. As a consequence, the issue of efficiently querying the underling P2P network is gaining momentum in the research community. Indeed, querying P2P networks, which can be in the unstructured and structure modes, plays a critical role in next-generation P2P systems, as its performance heavily affect the efficiency of the overall system. Starting from these considerations, in this paper we propose a survey on models, issues and algorithms for querying unstructured and structured P2P systems. We also put in evidence similarities and differences of state-of-the-art proposals appearing in literature, with critical discussion, and we provide a rigorous taxonomy of P2P query strategies. Finally, we complete our analytical contribution via hihlighting future directions in this research field.},
	keywords = {Issues and algorithms for P2P networks, Query models, Querying P2P networks, Routing P2P networks, Taxonomies of P2P query strategies},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949141961\&partnerID=40\&md5=6ec618e515388beb0fc88c49914b8058},
	author = {Cuzzocrea, A.}
}
