Keyword search in relational databases. By SO Tsz Yan Amanda & HON Ka Lam Ethan
|
|
- Hugh McCoy
- 6 years ago
- Views:
Transcription
1 Keyword search in relational databases By SO Tsz Yan Amanda & HON Ka Lam Ethan 1
2 Introduction Ubiquitous relational databases Need to know SQL and database structure Hard to define an object 2
3 Query representation How can we apply keyword search on relational databases? Data representation Query processing Result ranking Result representation 3
4 Query representation What is a query? Pre-processing operations The first step 4
5 Query representation Query = (finite) list of keywords The query needs to be pre-processed to understand better about the user s need. It will then be used for internal queries. Possible operations Logical conjunction (AND) vs disjunction (OR) Condition/filtering (e.g. year > 3000) Categorize keywords into types (NUITS) And more... 5
6 Logical conjunction (AND) vs disjunction (OR) AND = all keywords OR = some keywords Less common = OR (in top-k query processing) 6
7 Filtering/condition e.g. year > 3000 Limit candidate data 7
8 Data representation How a database is modeled Graph-based Data graph Schema graph Comparison 8
9 Finding top-k min-cost connected trees [2] 9
10 Finding top-k min-cost connected trees [2] Node = tuple Edge = relationship between 2 tuples Edge/node weight = function defined by the authors 10
11 Finding top-k min-cost connected trees [2] Query = {Keyword, Query, DB, Jim} 2 Steiner trees (candidates) Steiner tree = tree of subset of vertices Tree-1 is ranked higher (lower cost) Tree cost = edge weights 11
12 IR-Style Keyword Search [3] 12
13 IR-Style Keyword Search [3] Node = relation Edge = foreign key relationship from one relation to another 13
14 IR-Style Keyword Search [3] 1. Construct a schema graph 2. Use the schema graph to compute joining trees of tuples a. Joining tree nodes of tuples connected by an edge of foreign key relationship 3. Return the trees of the highest scores 14
15 Data graphs vs schema graphs Data graphs Schema graphs 1. Larger (nodes = records) 1. Smaller (nodes = relations) 2. Don t need access to database 2. Need access to database 3. Harder to maintain 3. Easier to maintain 15
16 Query processing Constructing an index Top-k query processing Effectiveness - Crucial requirement. 16
17 Indexing Structure - Inverted Index MOTIVATION : Avoid the need to linearly scan all of the tables in the database for every query. Traditional Way of finding location of a keyword: Inverted index Balmin A, Hristidis V, Papakonstantinou Y (2004) ObjectRank: authority-based keyword search in databases. In: Proceedings of the 30th international conference on very large data bases, pp , August 31 September 03, 2004, Toronto, Canada An inverted index that supports phrase searches 17
18 Indexing Structure - 2 Main Challenges 1. How to control granularity of indexed content 2. How to efficiently find the exact results from the indexed context 18
19 Indexing Structure - Symbol table A symbol table maintains the list of columns or cells that contain the keywords. Agrawal S, Chaudhuri S, Das G (2002) DBXplorer: a system for keyword-based search over relational databases. In: Proceedings of the 18th international conference on data engineering, pp 5 17, February 26 March 01, 2002, San Jose, California, USA 19
20 Indexing Structure - Symbol table (Compression) Larger symbol table increases the I/O cost during the search step Need to reduce the space needed for this auxiliary data. Compression Goldman R, Shivakumar N, Venkatasubramanian S, Garcia-Molina H (1998) Proximity search in databases. In: Proceedings of the 24th international conference on very large data bases, pp 26 37, August 24 27, 1998, San Francisco, California, USA 20
21 Indexing Structure Symbol table (Granularity levels) To reduce the scan time and storage space costs, symbol table is designed to several granularity levels of schema elements: column level and record level. 21
22 Why we need top-k processing techniques? Retrieve information scattered across several tables Require multiple JOIN operations. If the system attempts to join ALL of the tuples with ALL of the query keywords Extremely inefficient Only a few matches for query keywords are of interest. requires efficient top-k processing techniques. 22
23 Top-k query processing Users are only interested in a small number of results, k, that best match the given query keywords. 23
24 Top-k query processing - Candidate Network (CN) DISCOVER executes top-k queries by avoiding creation of ALL query results Shares intermediate results that are used for evaluating CN The top-k results are only distributed in a few CNs. search system has to decide which CN will produce top-k results CN: JOIN expressions to be used to create joining trees of tuples that will be considered as potential answers to the query. Architecture of DISCOVER Hristidis V, Papakonstantinou Y (2002) DISCOVER: keyword search in relational databases. In: Proceedings of the 28th international conference on very large data bases, pp , August 20 23, 2002, Hong Kong, China 24
25 Result ranking 1. RELEVANCE 2. IMPORTANCE R- Size of an answer R- Graph Representation R- IR weighting methods I- Authority transferring methods 25
26 Relevance - Size of an answer To measure the relevance, many approaches have considered the size of an answer as a ranking factor. Answers with smaller number of joins are generally more meaningful/ helpful. Luo Y, Lin X, Wang W, Zhou X (2007) SPARK: Top-k keyword query in relational databases. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data, pp , June 11 14, 2007 Beijing, China 26
27 Relevance - Graph Representation Answers represent as minimal subgraph that includes ALL of the query keywords. includes nodes that are not matched to the query keywords but just connect the matched nodes, e.g. T2 and T5 Should minimize non-matched nodes, and find a complete transitive closure STEINER TREE PROBLEM Join Trees Hulgeri A, Nakhe C (2002) Keyword searching and browsing in databases using BANKS. In: Proceedings of the 18th international conference on data engineering, pp , February 26 March 01, 2002, San Jose, California, USA 27
28 Relevance - Number of edges Nodes Edges Dataspot ranks candidate answers by the number of edges in the subgraph. Dataspot: Sample database (left), Hyperbase (right) Dar S, Entin G, Geva S, Palmon E (1998) DTL s dataspot: database exploration using plain language. In: Proceedings of the 24th international conference on very large data bases, pp , August 24 27, 1998, San Francisco, California, USA 28
29 Relevance - Semantic Closeness Proximity search differentiates distance between different kinds of schema elements - between a table and its attributes between tuples in the same table between tuples related through primary and foreign keys Regards the distance as the semantic closeness between objects. A fragment of the movie database relational schema and a database instance as a graph Using the shortest path between schema elements to measure size of an answer. Goldman R, Shivakumar N, Venkatasubramanian S, Garcia-Molina H (1998) Proximity search in databases. In: Proceedings of the 24th international conference on very large data bases, pp 26 37, August 24 27, 1998, San Francisco, California, USA 29
30 Relevance - IR weighting methods Ranking function considers each text column as a collection, and uses the standard IR weighting methods, e.g. tf-idf to compute a weight for each term in the field. [Focus on improving quality of relevance ranking for text documents] 30
31 Importance - Authority transferring methods The DBLP schema graph. Nodes with an incoming link with high authority are assumed to have higher importance. compute importance of node based on the link structure in the graph model. The DBLP authority transfer schema graph. Hristidis V, Hwang H, Papakonstantinou Y (2008) Authority-based keyword search in databases. ACM Trans Database Syst 33(1):
32 Importance - Authority transferring methods Authority transfer data graph. A subset of the DBLP graph. Sum of authority transfer rates of outgoing edges determines authority of the node within the same domain. a node that is referenced by other authoritative nodes obtains authority. Hristidis V, Hwang H, Papakonstantinou Y (2008) Authority-based keyword search in databases. ACM Trans Database Syst 33(1):1 40 An edge is omitted only if the transfer rate is 0 in that direction. Edge weights are assigned as the authority transfer rate.
33 Result representation Examples Little but essential 33
34 BANKS [4] {soumen, sunita} 34
35 Finding top-k min-cost connected trees [2] 35
36 Query representation Data representation Query processing Result ranking Result representation 36
37 References Park, Jaehui, and Sang-goo Lee. "Keyword search in relational databases." Knowledge and Information Systems 26.2 (2011): Ding, Bolin, et al. "Finding top-k min-cost connected trees in databases." Data Engineering, ICDE IEEE 23rd International Conference on. IEEE, Hristidis, Vagelis, Luis Gravano, and Yannis Papakonstantinou. "Efficient IR-style keyword search over relational databases." Proceedings of the 29th international conference on Very large data bases-volume 29. VLDB Endowment, Bhalotia, Gaurav, et al. "Keyword searching and browsing in databases using BANKS." Data Engineering, Proceedings. 18th International Conference on. IEEE,
Searching Databases with Keywords
Shan Wang et al.: Searching Databases with Keywords 1 Searching Databases with Keywords Shan Wang and Kun-Long Zhang School of Information, Renmin University of China, Beijing, 100872, P.R. China E-mail:
More informationImplementation of Skyline Sweeping Algorithm
Implementation of Skyline Sweeping Algorithm BETHINEEDI VEERENDRA M.TECH (CSE) K.I.T.S. DIVILI Mail id:veeru506@gmail.com B.VENKATESWARA REDDY Assistant Professor K.I.T.S. DIVILI Mail id: bvr001@gmail.com
More informationEffective Top-k Keyword Search in Relational Databases Considering Query Semantics
Effective Top-k Keyword Search in Relational Databases Considering Query Semantics Yanwei Xu 1,2, Yoshiharu Ishikawa 1, and Jihong Guan 2 1 Graduate School of Information Science, Nagoya University, Japan
More informationTop-k Keyword Search Over Graphs Based On Backward Search
Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer
More informationKeyword Search over Hybrid XML-Relational Databases
SICE Annual Conference 2008 August 20-22, 2008, The University Electro-Communications, Japan Keyword Search over Hybrid XML-Relational Databases Liru Zhang 1 Tadashi Ohmori 1 and Mamoru Hoshi 1 1 Graduate
More informationVolume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationKeyword query interpretation over structured data
Keyword query interpretation over structured data Advanced Methods of IR Elena Demidova Materials used in the slides: Jeffrey Xu Yu, Lu Qin, Lijun Chang. Keyword Search in Databases. Synthesis Lectures
More informationAchieving effective keyword ranked search by using TF-IDF and cosine similarity
Achieving effective keyword ranked search by using TF-IDF and cosine similarity M.PRADEEPA 1, V.MOHANRAJ 2 1PG scholar department of IT, Sona College of Technology,Tamilnadu,India. pradeepa92.murugan@gmail.com
More informationExtending Keyword Search to Metadata in Relational Database
DEWS2008 C6-1 Extending Keyword Search to Metadata in Relational Database Jiajun GU Hiroyuki KITAGAWA Graduate School of Systems and Information Engineering Center for Computational Sciences University
More informationRoadmap. Roadmap. Ranking Web Pages. PageRank. Roadmap. Random Walks in Ranking Query Results in Semistructured Databases
Roadmap Random Walks in Ranking Query in Vagelis Hristidis Roadmap Ranking Web Pages Rank according to Relevance of page to query Quality of page Roadmap PageRank Stanford project Lawrence Page, Sergey
More informationInformation Retrieval Using Keyword Search Technique
Information Retrieval Using Keyword Search Technique Dhananjay A. Gholap, Dr.Gumaste S. V Department of Computer Engineering, Sharadchandra Pawar College of Engineering, Dumbarwadi, Otur, Pune, India ABSTRACT:
More informationDbSurfer: A Search and Navigation Tool for Relational Databases
DbSurfer: A Search and Navigation Tool for Relational Databases Richard Wheeldon, Mark Levene and Kevin Keenoy School of Computer Science and Information Systems Birkbeck University of London Malet St,
More informationKeyword query interpretation over structured data
Keyword query interpretation over structured data Advanced Methods of Information Retrieval Elena Demidova SS 2018 Elena Demidova: Advanced Methods of Information Retrieval SS 2018 1 Recap Elena Demidova:
More informationEffective Keyword Search in Relational Databases for Lyrics
Effective Keyword Search in Relational Databases for Lyrics Navin Kumar Trivedi Assist. Professor, Department of Computer Science & Information Technology Divya Singh B.Tech (CSe) Scholar Pooja Pandey
More informationSupporting Fuzzy Keyword Search in Databases
I J C T A, 9(24), 2016, pp. 385-391 International Science Press Supporting Fuzzy Keyword Search in Databases Jayavarthini C.* and Priya S. ABSTRACT An efficient keyword search system computes answers as
More informationIntranet Search. Exploiting Databases for Document Retrieval. Christoph Mangold Universität Stuttgart
Intranet Search Exploiting Databases for Document Retrieval Christoph Mangold Universität Stuttgart 2 /6 The Big Picture: Assume. there is a glueing problem with product P7 Has this happened before? Is
More informationOntology Based Prediction of Difficult Keyword Queries
Ontology Based Prediction of Difficult Keyword Queries Lubna.C*, Kasim K Pursuing M.Tech (CSE)*, Associate Professor (CSE) MEA Engineering College, Perinthalmanna Kerala, India lubna9990@gmail.com, kasim_mlp@gmail.com
More informationA FRAMEWORK FOR PROCESSING KEYWORD-BASED QUERIES IN RELATIONAL DATABASES
A FRAMEWORK FOR PROCESSING KEYWORD-BASED QUERIES IN RELATIONAL DATABASES 1 EYAS EL-QAWASMEH, 1 OSSAMA ABU-EID, 2 ABDALLAH ALASHQUR 1 Jordan University of Science and Technology, Jordan 2 Applied Science
More informationKeyword Search in Databases
+ Databases and Information Retrieval Integration TIETS42 Keyword Search in Databases Autumn 2016 Kostas Stefanidis kostas.stefanidis@uta.fi http://www.uta.fi/sis/tie/dbir/index.html http://people.uta.fi/~kostas.stefanidis/dbir16/dbir16-main.html
More informationIJESRT. Scientific Journal Impact Factor: (ISRA), Impact Factor: 2.114
[Saranya, 4(3): March, 2015] ISSN: 2277-9655 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY ON KEYWORD QUERY ROUTING IN DATABASES N.Saranya*, R.Rajeshkumar, S.Saranya
More informationEfficient Engines for Keyword Proximity Search
Efficient Engines for Keyword Proximity Search Benny Kimelfeld The Selim and Rachel Benin School of Engineering and Computer Science The Hebrew University of Jerusalem Edmond J. Safra Campus Jerusalem
More informationMAINTAIN TOP-K RESULTS USING SIMILARITY CLUSTERING IN RELATIONAL DATABASE
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 MAINTAIN TOP-K RESULTS USING SIMILARITY CLUSTERING IN RELATIONAL DATABASE Syamily K.R 1, Belfin R.V 2 1 PG student,
More informationEvaluation of Keyword Search System with Ranking
Evaluation of Keyword Search System with Ranking P.Saranya, Dr.S.Babu UG Scholar, Department of CSE, Final Year, IFET College of Engineering, Villupuram, Tamil nadu, India Associate Professor, Department
More informationDepartment of Computer Engineering, Sharadchandra Pawar College of Engineering, Dumbarwadi, Otur, Pune, Maharashtra, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Information Retrieval
More informationISSN Vol.08,Issue.18, October-2016, Pages:
ISSN 2348 2370 Vol.08,Issue.18, October-2016, Pages:3571-3578 www.ijatir.org Efficient Prediction of Difficult Keyword Queries Over Data Bases SHALINI ATLA 1, DEEPTHI JANAGAMA 2 1 PG Scholar, Dept of CSE,
More informationHierarchical Result Views for Keyword Queries over Relational Databases
Hierarchical Result Views for Keyword Queries over Relational Databases Shiyuan Wang Department of Computer Science, UC Santa Barbara Santa Barbara, CA, USA sywang@cs.ucsb.edu Oliver Po NEC Laboratories
More informationPACOKS: Progressive Ant-Colony-Optimization-Based Keyword Search over Relational Databases
PACOKS: Progressive Ant-Colony-Optimization-Based Keyword Search over Relational Databases Ziyu Lin 1(B), Qian Xue 1, and Yongxuan Lai 2 1 Department of Computer Science, Xiamen University, Xiamen, China
More informationSemantic Search Focus: IR on Structured Data
Semantic Search Focus: IR on Structured Data 8th European Summer School on Information Retrieval Duc Thanh Tran Institute AIFB, KIT, Germany Tran@aifb.uni-karlsruhe.de http://sites.google.com/site/kimducthanh
More informationResults Clustering for Keyword Search over Relational Database
3188 JOURNAL OF SOFTWARE, VOL. 8, NO. 12, DECEMBER 2013 Results Clustering for Keyword Search over Relational Database Shuxin Yang School of Information Engineering,Jiangxi University of Science and Technology,Ganzhou
More informationRelational Keyword Search System
Relational Keyword Search System Pradeep M. Ghige #1, Prof. Ruhi R. Kabra *2 # Student, Department Of Computer Engineering, University of Pune, GHRCOEM, Ahmednagar, Maharashtra, India. * Asst. Professor,
More informationRELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES
RELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES Pramod Kumar Ghadei Research Scholar, Sathyabama University, Chennai, Tamil Nadu, India pramod-ghadei@yahoo.com Dr. S. Sridhar Research
More informationSPARK: Top-k Keyword Query in Relational Database
SPARK: Top-k Keyword Query in Relational Database Wei Wang University of New South Wales Australia 20/03/2007 1 Outline Demo & Introduction Ranking Query Evaluation Conclusions 20/03/2007 2 Demo 20/03/2007
More informationEffective Semantic Search over Huge RDF Data
Effective Semantic Search over Huge RDF Data 1 Dinesh A. Zende, 2 Chavan Ganesh Baban 1 Assistant Professor, 2 Post Graduate Student Vidya Pratisthan s Kamanayan Bajaj Institute of Engineering & Technology,
More informationISSN Vol.05,Issue.07, July-2017, Pages:
WWW.IJITECH.ORG ISSN 2321-8665 Vol.05,Issue.07, July-2017, Pages:1320-1324 Efficient Prediction of Difficult Keyword Queries over Databases KYAMA MAHESH 1, DEEPTHI JANAGAMA 2, N. ANJANEYULU 3 1 PG Scholar,
More informationInternational Journal of Advance Engineering and Research Development. Performance Enhancement of Search System
Scientific Journal of Impact Factor(SJIF): 3.134 International Journal of Advance Engineering and Research Development Volume 2,Issue 7, July -2015 Performance Enhancement of Search System Ms. Uma P Nalawade
More informationQuerying Wikipedia Documents and Relationships
Querying Wikipedia Documents and Relationships Huong Nguyen Thanh Nguyen Hoa Nguyen Juliana Freire School of Computing and SCI Institute, University of Utah {huongnd,thanhh,thanhhoa,juliana}@cs.utah.edu
More informationNovel Materialized View Selection in a Multidimensional Database
Graphic Era University From the SelectedWorks of vijay singh Winter February 10, 2009 Novel Materialized View Selection in a Multidimensional Database vijay singh Available at: https://works.bepress.com/vijaysingh/5/
More informationUsing Proximity Search to Estimate Authority Flow
Using Proximity Search to Estimate Authority Flow Vagelis Hristidis Yannis Papakonstantinou Ramakrishna Varadarajan School of Computing and Information Sciences Computer Science and Engineering Dept. Department
More informationKeyword Join: Realizing Keyword Search in P2P-based Database Systems
Keyword Join: Realizing Keyword Search in P2P-based Database Systems Bei Yu, Ling Liu 2, Beng Chin Ooi 3 and Kian-Lee Tan 3 Singapore-MIT Alliance 2 Georgia Institute of Technology, 3 National University
More informationToward Scalable Keyword Search over Relational Data
Toward Scalable Keyword Search over Relational Data Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, and Jeffrey Naughton University of Wisconsin, Madison {baid, ian, jxli, anhai, naughton}@cs.wisc.edu
More informationKeyword Search in Databases
Keyword Search in Databases Wei Wang University of New South Wales, Australia Outline Based on the tutorial given at APWeb 2006 Introduction IR Preliminaries Systems Open Issues Dr. Wei Wang @ CSE, UNSW
More informationDatabase Selection and Keyword Search of Structured Databases: Powerful Search for Naive Users
Database Selection and Keyword Search of Structured Databases: Powerful Search for Naive Users Mohammad HasSan@ Reda Alhajjl Mike J. Ridley" Ken Barked " School of Informatics Bradford University, Bradford
More informationEFFICIENT APPROACH FOR DETECTING HARD KEYWORD QUERIES WITH MULTI-LEVEL NOISE GENERATION
EFFICIENT APPROACH FOR DETECTING HARD KEYWORD QUERIES WITH MULTI-LEVEL NOISE GENERATION B.Mohankumar 1, Dr. P. Marikkannu 2, S. Jansi Rani 3, S. Suganya 4 1 3 4Asst Prof, Department of Information Technology,
More informationIntegrating and Querying Source Code of Programs Working on a Database
Integrating and Querying Source Code of Working on a Database Carlos Garcia-Alvarado University of Houston Dept. of Computer Science Houston, TX, USA Carlos Ordonez University of Houston Dept. of Computer
More informationQuery Segmentation Using Conditional Random Fields
Query Segmentation Using Conditional Random Fields Xiaohui Yu and Huxia Shi York University Toronto, ON, Canada, M3J 1P3 xhyu@yorku.ca,huxiashi@cse.yorku.ca ABSTRACT A growing mount of available text data
More informationEfficiently Enumerating Results of Keyword Search
Efficiently Enumerating Results of Keyword Search Benny Kimelfeld and Yehoshua Sagiv The Selim and Rachel Benin School of Engineering and Computer Science The Hebrew University of Jerusalem Edmond J. Safra
More informationKeyLabel Algorithms for Keyword Search in Large Graphs
KeyLabel Algorithms for Keyword Search in Large Graphs Yue Wang, Ke Wang, Ada Wai-Chee Fu, and Raymond Chi-Wing Wong School of Computing Science, Simon Fraser University Email: {ywa138, wangk }@cs.sfu.ca
More informationProcessing Recommender Top-N Queries in Relational Databases
Processing Recommender Top-N Queries in Relational Databases Liang Zhu1*, Quanlong Lei1, Guang Liu2, Feifei Liu1 1 Key Lab of Machine Learning and Computational Intelligence, School of Mathematics and
More informationInformation Retrieval Overview
Roadmap Information Retrieval Overview Vagelis Hristidis School of Computer Science Florida International University COP 6727 What is IR? Matching Models Evaluation of Results Digital Libraries vs. IR
More informationEfficient Keyword Search over Relational Data Streams
DEIM Forum 2016 A3-4 Abstract Efficient Keyword Search over Relational Data Streams Savong BOU, Toshiyuki AMAGASA, and Hiroyuki KITAGAWA Graduate School of Systems and Information Engineering, University
More informationInteractive keyword-based access to large-scale structured datasets
Interactive keyword-based access to large-scale structured datasets 2 nd Keystone Summer School 20 July 2016 Dr. Elena Demidova University of Southampton 1 Overview Keyword-based access to structured data
More informationPrinciples of Dataspaces
Principles of Dataspaces Seminar From Databases to Dataspaces Summer Term 2007 Monika Podolecheva University of Konstanz Department of Computer and Information Science Tutor: Prof. M. Scholl, Alexander
More informationAnswering Top K Queries Efficiently with Overlap in Sources and Source Paths
Answering Top K Queries Efficiently with Overlap in Sources and Source Paths Louiqa Raschid University of Maryland louiqa@umiacs.umd.edu María Esther Vidal Universidad Simón Bolívar mvidal@ldc.usb.ve Yao
More informationEfficient Keyword Search Across Heterogeneous Relational Databases
Efficient Keyword Search Across Heterogeneous Relational Databases Mayssam Sayyadian 1, Hieu LeKhac 2, AnHai Doan 1, Luis Gravano 3 1 University of Wisconsin-Madison 2 University of Illinois-Urbana 3 Columbia
More informationISSN: (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 2, Issue 3, March 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com
More informationEfficient Prediction of Difficult Keyword Queries over Databases
Efficient Prediction of Difficult Keyword Queries over Databases Gurramkonda Lakshmi Priyanka P.G. Scholar (M. Tech), Department of CSE, Srinivasa Institute of Technology & Sciences, Ukkayapalli, Kadapa,
More informationA Proximity-Based Fallback Model for Hybrid Web Recommender Systems
A Proximity-Based Fallback Model for Hybrid Web Recommender Systems Jaeseok Myung «supervised by Sang-goo Lee» Intelligent Data Systems Lab. School of Computer Science and Engineering, Seoul National University,
More informationINTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN EFFECTIVE KEYWORD SEARCH OF FUZZY TYPE IN XML
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 EFFECTIVE KEYWORD SEARCH OF FUZZY TYPE IN XML Mr. Mohammed Tariq Alam 1,Mrs.Shanila Mahreen 2 Assistant Professor
More informationABSTRACT I. INTRODUCTION
2015 IJSRSET Volume 1 Issue 2 Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Engineering and Technology ABSTRACT Database Traversal to Support Search Enhance Technique using SQL Sivakumar
More informationWEB DATA EXTRACTION METHOD BASED ON FEATURED TERNARY TREE
WEB DATA EXTRACTION METHOD BASED ON FEATURED TERNARY TREE *Vidya.V.L, **Aarathy Gandhi *PG Scholar, Department of Computer Science, Mohandas College of Engineering and Technology, Anad **Assistant Professor,
More informationAN INTERACTIVE FORM APPROACH FOR DATABASE QUERIES THROUGH F-MEASURE
http:// AN INTERACTIVE FORM APPROACH FOR DATABASE QUERIES THROUGH F-MEASURE Parashurama M. 1, Doddegowda B.J 2 1 PG Scholar, 2 Associate Professor, CSE Department, AMC Engineering College, Karnataka, (India).
More informationA System for Query-Specific Document Summarization *
A System for Query-Specific Document Summarization * Ramakrishna Varadarajan School of Computing and Information Sciences Florida International University Miami, FL 33199 ramakrishna@cis.fiu.edu Vagelis
More informationA System for Query-Specific Document Summarization
A System for Query-Specific Document Summarization Ramakrishna Varadarajan, Vagelis Hristidis. FLORIDA INTERNATIONAL UNIVERSITY, School of Computing and Information Sciences, Miami. Roadmap Need for query-specific
More informationEfficient Keyword Search for Smallest LCAs in XML Databases
Efficient Keyword Search for Smallest LCAs in XML Databases Yu Xu Department of Computer Science & Engineering University of California San Diego yxu@cs.ucsd.edu Yannis Papakonstantinou Department of Computer
More informationA NOVEL APPROACH ON SPATIAL OBJECTS FOR OPTIMAL ROUTE SEARCH USING BEST KEYWORD COVER QUERY
A NOVEL APPROACH ON SPATIAL OBJECTS FOR OPTIMAL ROUTE SEARCH USING BEST KEYWORD COVER QUERY S.Shiva Reddy *1 P.Ajay Kumar *2 *12 Lecterur,Dept of CSE JNTUH-CEH Abstract Optimal route search using spatial
More informationRDBMS. A Project Report Submitted in partial fulfilment of the requirements for the Degree of Master of Engineering
Keyword Index: Design and Implementation Inside RDBMS A Project Report Submitted in partial fulfilment of the requirements for the Degree of Master of Engineering in Computer Science and Engineering by
More informationEffici ent Type-Ahead Search on Rel ati onal D ata: a TASTIER Approach
Effici ent Type-Ahead Search on Rel ati onal D ata: a TASTIER Approach Guoliang Li Shengyue Ji Chen Li Jianhua Feng Department of Computer Science and Technology, Tsinghua National Laboratory for Information
More informationSpiderX: Fast XML Exploration System
SpiderX: Fast XML Exploration System Chunbin Lin, Jianguo Wang Computer Science and Engineering, California, San Diego La Jolla, California, USA chunbinlin@cs.ucsd.edu, csjgwang@cs.ucsd.edu ABSTRACT Keyword
More informationObjectRank: Authority-Based Keyword Search in Databases
ObjectRank: Authority-Based Keyword Search in Databases Andrey Balmin IBM Almaden Research Center San Jose, CA 95120 abalmin@us.ibm.com Vagelis Hristidis School of Computer Science Florida International
More informationSearching the Web What is this Page Known for? Luis De Alba
Searching the Web What is this Page Known for? Luis De Alba ldealbar@cc.hut.fi Searching the Web Arasu, Cho, Garcia-Molina, Paepcke, Raghavan August, 2001. Stanford University Introduction People browse
More informationRanked Keyword Query on Semantic Web Data
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2010) Ranked Keyword Query on Semantic Web Data Huiying Li School of Computer Science and Engineering Southeast University
More informationKeyword Join: Realizing Keyword Search for Information Integration
Keyword Join: Realizing Keyword Search for Information Integration Bei YU, Ling LIU 2, Beng Chin OOI,3 and Kian-Lee TAN,3 Singapore-MIT Alliance, National University of Singapore 2 College of Computing,
More informationA Graph Method for Keyword-based Selection of the top-k Databases
This is the Pre-Published Version A Graph Method for Keyword-based Selection of the top-k Databases Quang Hieu Vu 1, Beng Chin Ooi 1, Dimitris Papadias 2, Anthony K. H. Tung 1 hieuvq@nus.edu.sg, ooibc@comp.nus.edu.sg,
More informationACCELERATING SELECT WHERE AND SELECT JOIN QUERIES ON A GPU
Computer Science 14 (2) 2013 http://dx.doi.org/10.7494/csci.2013.14.2.243 Marcin Pietroń Pawe l Russek Kazimierz Wiatr ACCELERATING SELECT WHERE AND SELECT JOIN QUERIES ON A GPU Abstract This paper presents
More informationPrécis: The Essence of a Query Answer *
Précis: The Essence of a Query Answer * Georgia Koutrika University of Athens koutrika@di.uoa.gr Alkis Simitsis Nat. Tech. Univ. of Athens asimi@dblab.ntua.gr Yannis Ioannidis University of Athens yannis@di.uoa.gr
More informationA NEW WATERMARKING TECHNIQUE FOR SECURE DATABASE
Online Journal, www.ijcea.com A NEW WATERMARKING TECHNIQUE FOR SECURE DATABASE Jun Ziang Pinn 1 and A. Fr. Zung 2 1,2 P. S. University for Technology, Harbin 150001, P. R. China ABSTRACT Digital multimedia
More informationGinix: Generalized Inverted Index for Keyword Search
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA MINING VOL:8 NO:1 YEAR 2013 Ginix: Generalized Inverted Index for Keyword Search Hao Wu, Guoliang Li, and Lizhu Zhou Abstract: Keyword search has become a ubiquitous
More informationImproved Structured Robustness (I-SR): A Novel Approach to Predict Hard Keyword Queries
Journal of Scientific & Industrial Research Vol. 76, January 2017, pp. 38-43 Improved Structured Robustness (I-SR): A Novel Approach to Predict Hard Keyword Queries M S Selvi, K Deepa, M S Sangari* and
More informationKeyword Search over Graph-structured Data for Finding Effective and Non-redundant Answers
Keyword Search over Graph-structured Data for Finding Effective and Non-redundant Answers Chang-Sup Park Department of Computer Science Dongduk Women s University Seoul, Korea cspark@dongduk.ac.kr Abstract
More informationTowards open-source shared implementations of keyword-based access systems to relational data
Towards open-source shared implementations of keyword-based access systems to relational data Alex Badan, Luca Benvegnù, Matteo Biasetton, Giovanni Bonato, Alessandro Brighente, Alberto Cenzato, Piergiorgio
More informationEnhancing Search with Structure
Enhancing Search with Structure Soumen Chakrabarti Sunita Sarawagi S. Sudarshan Computer Science and Engineering Department Indian Institute Of Technology, Bombay, India {soumen,sunita,sudarsha}@cse.iitb.ac.in
More informationAuthority-Based Keyword Search in Databases
Authority-Based Keyword Search in Databases Vagelis Hristidis Florida International University Miami, FL 33199 vagelis@cis.fiu.edu and Heasoo Hwang Computer Science & Engineering UC, San Diego La Jolla,
More informationOPTIMIZED METHOD FOR INDEXING THE HIDDEN WEB DATA
International Journal of Information Technology and Knowledge Management July-December 2011, Volume 4, No. 2, pp. 673-678 OPTIMIZED METHOD FOR INDEXING THE HIDDEN WEB DATA Priyanka Gupta 1, Komal Bhatia
More informationImproving Data Access Performance by Reverse Indexing
Improving Data Access Performance by Reverse Indexing Mary Posonia #1, V.L.Jyothi *2 # Department of Computer Science, Sathyabama University, Chennai, India # Department of Computer Science, Jeppiaar Engineering
More informationInformation Discovery, Extraction and Integration for the Hidden Web
Information Discovery, Extraction and Integration for the Hidden Web Jiying Wang Department of Computer Science University of Science and Technology Clear Water Bay, Kowloon Hong Kong cswangjy@cs.ust.hk
More informationKeyword Search in External Memory Graph Representations of Data
Keyword Search in External Memory Graph Representations of Data B. Tech. Seminar Report Submitted in partial fulfillment of the requirements for the degree of Bachelor of Technology by Avin Mittal Roll
More informationNOVEL CACHE SEARCH TO SEARCH THE KEYWORD COVERS FROM SPATIAL DATABASE
NOVEL CACHE SEARCH TO SEARCH THE KEYWORD COVERS FROM SPATIAL DATABASE 1 Asma Akbar, 2 Mohammed Naqueeb Ahmad 1 M.Tech Student, Department of CSE, Deccan College of Engineering and Technology, Darussalam
More informationSearching SNT in XML Documents Using Reduction Factor
Searching SNT in XML Documents Using Reduction Factor Mary Posonia A Department of computer science, Sathyabama University, Tamilnadu, Chennai, India maryposonia@sathyabamauniversity.ac.in http://www.sathyabamauniversity.ac.in
More informationROU: Advanced Keyword Search on Graph
ROU: Advanced Keyword Search on Graph Yifan Pan Indiana University panyif@cs.indiana.edu Yuqing Wu Indiana University yuqwu@cs.indiana.edu ABSTRACT Keyword search, due to its simplicity in expressing search
More informationKeyword Search over Relational Tables and Streams
Keyword Search over Relational Tables and Streams ALEXANDER MARKOWETZ University of Bonn, Germany. YIN YANG Hong Kong University of Science and Technology, Hong Kong. AND DIMITRIS PAPADIAS Hong Kong University
More informationKeyword Proximity Search on XML Graphs
Keyword Proximity Search on XML Graphs Vagelis Hristidis Yannis Papakonstantinou Andrey Balmin Computer Science and Engineering Dept. University of California, San Diego {vagelis,yannis,abalmin}@cs.ucsd.edu
More informationEFFICIENT AND EFFECTIVE AGGREGATE KEYWORD SEARCH ON RELATIONAL DATABASES
EFFICIENT AND EFFECTIVE AGGREGATE KEYWORD SEARCH ON RELATIONAL DATABASES by Luping Li B.Eng., Renmin University, 2009 a Thesis submitted in partial fulfillment of the requirements for the degree of MASTER
More informationAutoJoin: Providing Freedom from Specifying Joins
AutoJoin: Providing Freedom from Specifying Joins Terrence Mason Iowa Database and Emerging Applications Laboratory, Computer Science University of Iowa Email: terrence-mason, lixin-wang, ramon-lawrence@uiowa.uiowa.edu
More informationQunits: queried units for database search
Qunits: queried units for database search Arnab Nandi Computer Science, EECS University of Michigan, Ann Arbor arnab@umich.edu H.V. Jagadish Computer Science, EECS University of Michigan, Ann Arbor jag@umich.edu
More informationOptimization of Queries in Distributed Database Management System
Optimization of Queries in Distributed Database Management System Bhagvant Institute of Technology, Muzaffarnagar Abstract The query optimizer is widely considered to be the most important component of
More informationSPATIAL INVERTED INDEX BY USING FAST NEAREST NEIGHBOR SEARCH
SPATIAL INVERTED INDEX BY USING FAST NEAREST NEIGHBOR SEARCH 1 Narahari RajiReddy 2 Dr G Karuna 3 Dr G Venkata Rami Reddy 1 M. Tech Student, Department of CSE, School of InformationTechnology-JNTUH, Hyderabad
More informationAggregate Keyword Search on Large Relational Databases
Noname manuscript No. (will be inserted by the editor) Aggregate Keyword Search on Large Relational Databases Bin Zhou Jian Pei Received: November 17, 2009 / Revised: December 05, 2010 / Accepted: December
More informationQuery Optimization in Distributed Databases. Dilşat ABDULLAH
Query Optimization in Distributed Databases Dilşat ABDULLAH 1302108 Department of Computer Engineering Middle East Technical University December 2003 ABSTRACT Query optimization refers to the process of
More informationAN ARCHITECTURE FOR FAST AJAX ENABLED WEB FORMS. Bryon Chan
AN ARCHITECTURE FOR FAST AJAX ENABLED WEB FORMS Bryon Chan Department of Electrical and Computer Engineering University of Auckland, Auckland, New Zealand Abstract This project aims to improve the usability
More informationEASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data
: An Effective 3-in- Keyword Search Method for Unstructured, Semi-structured and Structured Data Guoliang Li Beng Chin Ooi 2 Jianhua Feng Jianyong Wang Lizhu Zhou Department of Computer Science and Technology,
More information