CONSTRUCTION OF ENQUIRY RELAXATIONS FOR SUPPORTING MORE DATA

V Vennela, P Gurulingam

Abstract


Ranking and coming back most likely the most germane outcomes of a question have grown to be typically the most popular paradigm in XML query processing. To deal with this issue, we first speak a posh framework of query relaxations for uphold approximate question over XML data. The solutions basic this framework isn’t necessitating to strictly effectuate the fixed query formulation rather, they may be based on qualities inferable in the original query. However, the present proposals don't adequately take form into deliberation, plus they, therefore, Mr.'t have the strength to stylishly combine structures with contents to follow up to the relaxed question. Within our solution, we classify nodes into two groups: categoric attribute nodes and statistical attribute nodes, and style the related approaches on the similarity relation assessments of categorical ascribe nodes and statistical attribute nodes. We complement the cause usage of a comprehensive group of experiments to exhibit the potency of our suggested advances when it comes to precision and recall metrics. Querying XML data repeatedly grow unmanageable in practical applications, inasmuch as the hierarchic form of XML documents might be mixed, and then any unimportant misunderstanding from the school structure can beyond doubt grow the wager for formulation of unsatisfiable queries. This really is austere, distinctly in light to the fact that such queries yield empty solutions, although not composition errors. Additionally, we design signature-based directed acyclic graph to cause and organize make relaxations and disentangle futile assessment coefficient for that likeness relation assessment on makeup. We, then, composed a recent top-k recovery approach that may smartly create the most promising solutions within a command correlated worn the ranking measure.


Keywords


Top-K; Query Relaxations; XML; Answer Score; Querying XML;

References


N. Bruno, N. Koudas, and D. Srivastava, “Holistic twig joins: Optimal XMLpatternmatching,”inProc.SIGMODInt.Conf.Manag.Data,2002, pp. 310–321.

A. Campi, E. Damiani, S. Guinea, S. Marrara, and P. Spoletini, “A fuzzy extension of the XPath query language,” J. Intell. Inform. Syst., vol. 33, no. 3, pp. 285–305, 2008.

E. Damiani, L. Tanca, and A. F. Fontana, “Fuzzy xml queries via contextbased choice of aggregations,” Kybernetika, vol. 36, pp. 635–655, 2000.

B. Fazzinga, S. Flesca, and A. Pugliiese, “Top-k answers to fuzzy XPath queries,” in Proc. Int. Conf. Database Expert Syst. Appl., 2009, pp. 822– 829.

A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse, “XMark: A benchmark for XML data management,” in Proc. Int. Conf. Very Large Data Bases, 2002, pp. 974–985.

A. Simitsis, G. Kourtrika, and Y. Ioannidis, “Precis: From unstructured keywords as queries to structured databases as answers,” VLDB J., vol. 17, no. 1, pp. 117–149, 2008.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.