Sciweavers

6654 search results - page 254 / 1331
» Querying Faceted Databases
Sort
View
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
16 years 25 days ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
SIGIR
2003
ACM
15 years 12 months ago
Structured use of external knowledge for event-based open domain question answering
One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcom...
Hui Yang, Tat-Seng Chua, Shuguang Wang, Chun-Keat ...
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
16 years 6 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
PVLDB
2010
122views more  PVLDB 2010»
15 years 5 months ago
Avalanche-Safe LINQ Compilation
We report on a query compilation technique that enables the construction of alternative efficient query providers for Microsoft’s Language Integrated Query (LINQ) framework. LIN...
Torsten Grust, Jan Rittinger, Tom Schreiber
XSYM
2005
Springer
84views Database» more  XSYM 2005»
16 years 3 days ago
Patterns and Types for Querying XML Documents
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
Giuseppe Castagna