Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Structural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently (0911.4329v2)

Published 23 Nov 2009 in cs.DB

Abstract: XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to eliminate spurious results have enjoyed some success by using the concepts of LCA or its variants, SLCA and MLCA. However, existing methods still could find many spurious results. The fundamental cause for the occurrence of spurious results is that the existing methods try to eliminate spurious results locally without global examination of all the query results and, accordingly, some spurious results are not consistently eliminated. In this paper, we propose a novel keyword search method that removes spurious results consistently by exploiting the new concept of structural consistency.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Ki-Hoon Lee (1 paper)
  2. Kyu-Young Whang (7 papers)
  3. Wook-Shin Han (15 papers)
  4. Min-Soo Kim (47 papers)
Citations (16)