Conditional selectivity for statistics on query expressions

2004 ◽  
Author(s):  
Nicolas Bruno ◽  
Surajit Chaudhuri
Keyword(s):  
Query Expressions

Generating English paraphrases from relational query expressions

1985 ◽  
Vol 4 (4) ◽  
pp. 337-348
Author(s):  
Barry G. T. Lowden ◽  
Anne De Roeck
Keyword(s):  
Query Expressions

Manipulating Query Expressions

2012 ◽  
pp. 21-63
Author(s):  
AnHai Doan ◽  
Alon Halevy ◽  
Zachary Ives
Keyword(s):  
Query Expressions

Advanced SQL Query Expressions

SQL: 1999 ◽  
2002 ◽  
pp. 265-353
Author(s):  
Jim Melton ◽  
Alan R. Simon
Keyword(s):  
Sql Query ◽  
Query Expressions

scholarly journals An Effective Preprocessing Algorithm for Information Retrieval System

2019 ◽  
Vol 8 (3) ◽  
pp. 6371-6375
Keyword(s):  
Information Retrieval ◽  
Web Search ◽  
Search Term ◽  
Search String ◽  
Term Selection ◽  
Internet Users ◽  
User Query ◽  
Spell Check ◽  
The Web ◽  
Query Expressions

The innovation of web produced a huge of information, evaluates by empowering Internet users to post their assessments, remarks, and audits on the web. Preprocessing helps to understand a user query in the Information Retrieval (IR) system. IR acts as the container to representation, seeking and access information that relates to a user search string. The information is present in natural language by using some words; it’s not structured format, and sometimes that word often ambiguous. One of the major challenges determines in current web search vocabulary mismatch problem during the preprocessing. In an IR system determine a drawback in web search; the search query string is that the relationships between the query expressions and the expanded terms are limited. The query expressions relate to search term fetching information from the IR. The expanded terms by adding those terms that is most similar to the words of the search string. In this manuscript, we mainly focus on behind user’s search string on the web. We identify the best features within this context for term selection in supervised learning based model. In this proposed system the main focus of preprocessing techniques like Tokenization, Stemming, spell check, find dissimilar words and discover the keywords from the user query because provide better results for the user

Efficient Schemes of Executing Star Operators in XPath Query Expressions

2006 ◽  
pp. 264-278 ◽  
Author(s):  
Young Chul Park ◽  
Je Hyun Cho ◽  
Geum Ji Cha ◽  
Peter Scheuermann
Keyword(s):  
Xpath Query ◽  
Query Expressions
Sign in / Sign up

Export Citation Format

Share Document