Sciweavers

145 search results - page 17 / 29
» Data summaries for on-demand queries over linked data
Sort
View
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 3 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
182
Voted
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
15 years 10 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
15 years 9 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
XSYM
2007
Springer
150views Database» more  XSYM 2007»
15 years 3 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
RIAO
2007
14 years 11 months ago
Capturing Sentence Prior for Query-Based Multi-Document Summarization
In this paper, we have considered a real world information synthesis task, generation of a fixed length multi document summary which satisfies a specific information need. This...
Jagadeesh Jagarlamudi, Prasad Pingali, Vasudeva Va...