2889 search results - page 277 / 578 » Querying Structured Hyperdocuments |
135
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
226
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
156
click to vote
XSYM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. LONG PAPER. BaseX is an early adopter of the upcoming XQuery Full Text Recommendation. This paper presents some of the enhancements made to the XML database to fully supp...
152
click to vote
ICECCS
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conf...
124
Voted
SIGIR
2005
ACM
15 years 10 months ago
2005
ACM
In this poster we describe alternative inverted index structures that reduce the time required to process queries, produce a higher query throughput and still return high quality ...