Sciweavers

3652 search results - page 108 / 731
» A study of query length
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 8 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ICDT
2005
ACM
125views Database» more  ICDT 2005»
14 years 1 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
EDBT
2009
ACM
90views Database» more  EDBT 2009»
14 years 17 days ago
Parallelization of XPath queries using multi-core processors: challenges and experiences
In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a sce...
Rajesh Bordawekar, Lipyeow Lim, Oded Shmueli
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 5 days ago
Interaction of Query Evaluation and Buffer Management for Information Retrieval
The proliferation of the World Wide Web has brought information retrieval (IR) techniques to the forefront of search technology. To the average computer user, “searching” now ...
Björn Þór Jónsson, Michae...
CIKM
2009
Springer
13 years 12 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng