Sciweavers

SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 7 months ago
Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason
We are experiencing a new Social Web, where people share, communicate, commiserate, and conflict with each other. As evidenced by systems like Wikipedia, twitter, and delicious.co...
Ed H. Chi
SIGMOD
2009
ACM
150views Database» more  SIGMOD 2009»
14 years 7 months ago
DBDOC: querying and browsing databases and interrelated documents
Large collections of documents are commonly created around a database, where a typical database schema may contain hundreds of tables and thousands of columns. We developed a syst...
Carlos Garcia-Alvarado, Carlos Ordonez, Zhibo Chen...
SIGMOD
2009
ACM
133views Database» more  SIGMOD 2009»
14 years 7 months ago
Hierarchical result views for keyword queries over relational databases
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
Shiyuan Wang, Jun'ichi Tatemura, Arsany Sawires, O...
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
14 years 7 months ago
Building search applications with Marklogic Server
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
Ron Avnur
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
14 years 7 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
14 years 7 months ago
XML keyword query refinement
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
14 years 7 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 7 months ago
Generic and effective semi-structured keyword search
Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they ar...
Arash Termehchy, Marianne Winslett