Sciweavers

32117 search results - page 6157 / 6424
» Design for Unanticipated Use..
Sort
View
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 6 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
16 years 6 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
137views Database» more  SIGMOD 2009»
16 years 6 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
132views Database» more  SIGMOD 2009»
16 years 6 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 6 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
« Prev « First page 6157 / 6424 Last » Next »