Sciweavers

250 search results - page 37 / 50
» Tree pattern query minimization
Sort
View
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 1 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
15 years 11 months ago
Ontology-Aware Search on XML-based Electronic Medical Records
As the use of Electronic Medical Records (EMRs) becomes more widespread, so does the need for effective information discovery on them. Recently proposed EMR standards are XML-based...
Anand Ranganathan, Fernando Farfán, Redmond...
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
88
Voted
SPAA
2009
ACM
15 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
FOCS
2000
IEEE
15 years 2 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount