Sciweavers

1388 search results - page 178 / 278
» Querying Linguistic Trees
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 7 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
PVLDB
2010
101views more  PVLDB 2010»
14 years 7 months ago
InZeit: Efficiently Identifying Insightful Time Points
Web archives are useful resources to find out about the temporal evolution of persons, organizations, products, or other topics. However, even when advanced text search functional...
Vinay Setty, Srikanta J. Bedathur, Klaus Berberich...
94
Voted
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
15 years 4 months ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
DOLAP
2000
ACM
15 years 5 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
128
Voted
JACM
2008
91views more  JACM 2008»
15 years 19 days ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari