Sciweavers

709 search results - page 42 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
WWW
2007
ACM
16 years 6 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
SIGMOD
2004
ACM
148views Database» more  SIGMOD 2004»
16 years 5 months ago
Vertical and Horizontal Percentage Aggregations
Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such lim...
Carlos Ordonez
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
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
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
15 years 9 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link