Access the full text.
Sign up today, get DeepDyve free for 14 days.
Floris Geerts, H. Mannila, Evimaria Terzi (2004)
Relational link-based ranking
J. Kleinberg (1999)
Authoritative sources in a hyperlinked environment
S. Chaudhuri, Gautam Das, Vagelis Hristidis, G. Weikum (2004)
Probabilistic Ranking of Database Query Results
(1992)
IBM : DB 2 Text Information Extender
S. Agrawal, S. Chaudhuri, Gautam Das (2002)
DBXplorer: enabling keyword search over relational databases
Andrey Balmin, Vagelis Hristidis, Y. Papakonstantinou (2004)
ObjectRank: Authority-Based Keyword Search in Databases
Vagelis Hristidis, Nick Koudas, Y. Papakonstantinou, D. Srivastava (2006)
Keyword proximity search in XML treesIEEE Transactions on Knowledge and Data Engineering, 18
Vagelis Hristidis, Y. Papakonstantinou (2002)
DISCOVER: Keyword Search in Relational Databases
K. Chakrabarti, S. Chaudhuri, Seung-won Hwang (2004)
Automatic categorization of query results
Ute Masermann, G. Vossen (2000)
Design and Implementation of a Novel Approach to Keyword Searching in Relational Databases
W. Greiff (2002)
The use of Exploratory Data Analysis in Information Retrieval Research
Luis Gravano (2001)
Letter from the Special Issue EditorIEEE Data Eng. Bull., 24
MySQL: MySQL. url: http://dev.mysql.com/doc/refman/5.0/en/fulltext- search.html 49. Oracle: Oracle 9i Text
G. Marchionini (1992)
Interfaces for End-User Information SeekingJ. Am. Soc. Inf. Sci., 43
Panayiotis Tsaparas, Themis Palpanas, Y. Kotidis, Nick Koudas, D. Srivastava (2003)
Ranked join indicesProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
E.J. McCluskey (1986)
Logic Design Principles
A. Yakhnis, Wu Ke (1998)
Searching the world wide WebScience, 280 5360
S. Robertson (1997)
The probability ranking principle in IR
G. Koutrika, Y. Ioannidis (2005)
Personalized queries under a generalized preference model21st International Conference on Data Engineering (ICDE'05)
H. Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma (2002)
Probabilistic query expansion using query logsProceedings of the 11th international conference on World Wide Web
A. Maier, David Simmen (2001)
DB2 Optimization in Support of Full Text Search.IEEE Data(base) Engineering Bulletin, 24
Fang Liu, Clement Yu, W. Meng, Abdur Chowdhury (2006)
Effective keyword search in relational databasesProceedings of the 2006 ACM SIGMOD international conference on Management of data
A. Simitsis, G. Koutrika (2006)
Comprehensible Answers to Précis Queries
W. Croft (2001)
Book Reviews: Advances in Information Retrieval: Recent Research from the Center for Intelligent Information Retrieval
Qianying Wang, C. Nass, Jiang Hu (2005)
Natural Language Query vs. Keyword Search: Effects of Task Complexity on Search Performance, Participant Perceptions, and Preferences
Yufei Tao, Vagelis Hristidis, D. Papadias, Y. Papakonstantinou (2007)
Branch-and-bound processing of ranked queriesInf. Syst., 32
Vagelis Hristidis, Y. Papakonstantinou, Andrey Balmin (2003)
Keyword proximity search on XML graphsProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
J.R. Hamilton, T.K. Nayak (2001)
Microsoft SQL server full-text searchIEEE Data Eng. Bull., 24
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan (2002)
Keyword searching and browsing in databases using BANKSProceedings 18th International Conference on Data Engineering
S. Brin, Lawrence Page (1998)
The Anatomy of a Large-Scale Hypertextual Web Search EngineComput. Networks, 30
D. Florescu, Donald Kossmann, I. Manolescu (2000)
Integrating Keyword Search into XML Query ProcessingComput. Networks, 33
Jamie Callan, W. Croft, S. Harding (1992)
The INQUERY Retrieval System
B. Kimelfeld, Y. Sagiv (2005)
Efficient Engines for Keyword Proximity Search
Lin Guo, F. Shao, C. Botev, J. Shanmugasundaram (2003)
XRANK: ranked keyword search over XML documents
Amihai Motro (1986)
BAROQUE: a browser for relational databasesACM Trans. Inf. Syst., 4
S. Agrawal, S. Chaudhuri, Gautam Das, A. Gionis (2003)
Automated Ranking of Database Query Results
(1971)
The SMART System—Experiments in automatic document processing
Vagelis Hristidis, L. Gravano, Y. Papakonstantinou (2003)
Efficient IR-Style Keyword Search over Relational Databases
G. Koutrika, A. Simitsis, Y. Ioannidis (2006)
Précis: The Essence of a Query Answer22nd International Conference on Data Engineering (ICDE'06)
J. Allan (1998)
Readings in information retrieval.Information Processing and Management, 34
Arvind Hulgeri, Gaurav Bhalotia, Charuta Nakhey, Soumen Chakrabarti, S. Sudarshan, Byron ByronD, Sunita SunitaS (2007)
Keyword Search in Databases
V. Kacholia, Shashank Pandit, Soumen Chakrabarti, S. Sudarshan, Rushi Desai, Hrishikesh Karambelkar (2005)
Bidirectional Expansion For Keyword Search on Graph Databases
A. Simitsis, G. Koutrika (2006)
Pattern-Based Query Answering
W. Croft, David Harper (1979)
Using Probabilistic Models of Document Retrieval without Relevance InformationJ. Documentation, 35
Allan Collins, M. Quillian (1969)
Retrieval time from semantic memory
X. Dong, A. Halevy, J. Madhavan (2005)
Reference reconciliation in complex information spaces
(2000)
Special issue on data cleaning
S. Agrawal, S. Chaudhuri, Gautam Das (2002)
DBXplorer: a system for keyword-based search over relational databasesProceedings 18th International Conference on Data Engineering
(1986)
Oracle : Oracle 9 i Text
Arvind Hulgeri, Gaurav Bhalotia, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan (2001)
Keeyword Search in Databases.IEEE Data(base) Engineering Bulletin, 24
B. Kimelfeld, Y. Sagiv (2005)
Efficiently Enumerating Results of Keyword Search
W. Cooper (1988)
Getting beyond BooleInf. Process. Manag., 24
Frank Hwang, D. Richards (1992)
Steiner tree problemsNetworks, 22
N. Bhatti, A. Bouch, A. Kuchinsky (2000)
Integrating user-perceived quality into Web server designComput. Networks, 33
Roy Goldman, N. Shivakumar, S. Venkatasubramanian, H. Garcia-Molina (1998)
Proximity Search in Databases
Karen Jones, P. Willett (1997)
Readings in information retrieval
D. Florescu, A. Halevy, A. Mendelzon (1998)
Database techniques for the World-Wide Web: a surveySIGMOD Rec., 27
B. Kimelfeld, Y. Sagiv (2006)
Finding and approximating top-k answers in keyword proximity search
Paul Dixon (2001)
Basics of Oracle Text Retrieval.IEEE Data(base) Engineering Bulletin, 24
H. Lau (1986)
Steiner Tree Problem
Amihai Motro (1986)
Constructing queries from tokens
Oscar González (2000)
Microsoft SQL Server 2000
Jens Graupmann, Ralf Schenkel, G. Weikum (2005)
The SphereSearch Engine for Unified Ranked Retrieval of Heterogeneous XML and Web Documents
华山, 肖光平, 袁鹏飞 (1999)
SQL Server数据复制(上)
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. Sudarshan (2006)
Ordering the attributes of query resultsProceedings of the 2006 ACM SIGMOD international conference on Management of data
Shan Wang, Kunlong Zhang (2005)
Searching Databases with KeywordsJournal of Computer Science and Technology, 20
A. Simitsis, G. Koutrika, Y. Ioannidis (2007)
Generalized Précis Queries for Logical Database Subset Creation2007 IEEE 23rd International Conference on Data Engineering
F. Ferguson (1988)
Book Review: Logic Design Principles by Edward J. McCluskey: Prentice-Hall Publishers, Englewood Cliffs, New Jersey, 549 pp., $39.95SIGARCH Comput. Archit. News, 16
Précis queries represent a novel way of accessing data, which combines ideas and techniques from the fields of databases and information retrieval. They are free-form, keyword-based, queries on top of relational databases that generate entire multi-relation databases, which are logical subsets of the original ones. A logical subset contains not only items directly related to the given query keywords but also items implicitly related to them in various ways, with the purpose of providing to the user much greater insight into the original data. In this paper, we lay the foundations for the concept of logical database subsets that are generated from précis queries under a generalized perspective that removes several restrictions of previous work. In particular, we extend the semantics of précis queries considering that they may contain multiple terms combined through the AND , OR , and NOT operators. On the basis of these extended semantics, we define the concept of a logical database subset, we identify the one that is most relevant to a given query, and we provide algorithms for its generation. Finally, we present an extensive set of experimental results that demonstrate the efficiency and benefits of our approach.
The VLDB Journal – Springer Journals
Published: Jan 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.