Sciweavers

136 search results - page 20 / 28
» Optimization and Dataflow Algorithms for Nested Tree Queries
Sort
View
GEOINFO
2003
14 years 11 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
72
Voted
DOCENG
2009
ACM
15 years 4 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
15 years 11 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
WWW
2008
ACM
15 years 10 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
82
Voted
TKDE
2011
330views more  TKDE 2011»
14 years 4 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...