Searching for authors named "Neoklis Polyzotis" – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
and MINOS GAROFALAKIS
- …Effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching thr…
- Add To MetaCart
-
Structure and Value Synopses for XML Data Graphs
- …All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XML data graph, and (2) predicates on the values of specific path/branch nodes, in order to reach the desired data elements…
- Cited by 43 (3 self) – Add To MetaCart
-
XCLUSTER synopses for structured XML content
- …We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a novel XML-summarization model, termed XCLUSTERs, that enables accurate selectivity estimates for the class of twig queries w…
- Cited by 6 (2 self) – Add To MetaCart
-
Speculative Query Processing
- …Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many successfull applications of speculation: modern processors, for example, speculate on the run-time properties of a program a…
- Cited by 4 (0 self) – Add To MetaCart
-
BEA Systems and
- …This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate approximate answers for complex relational queries. The proposed summarization framework adopts a “semi-structured ” view of the relational database, modeling a relational data set as a graph of …
- Add To MetaCart
-
Sketch-based Summarization of Ordered XML Streams
- …Abstract — In this paper, we tackle the problem of approximately answering a continuous aggregate query over an XML stream using limited memory. This problem is key in the development of tools for the on-line monitoring and analysis of streaming XML data, such as complex event streams, RSS feeds, or…
- Add To MetaCart
-
Approximate Answers for XML Queries with Range Predicates
- …In this paper, we tackle the difficult problem of summarizing the path/branching structure and numerical value content of an XML database. We introduce a novel, powerful XML-summarization model, termed VTreeSketches, that enables accurate approximate answers for the class of twig queries with numeri…
- Add To MetaCart
-
Tuple Graph Synopses for Relational Data Sets ∗
- …This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summarization framework adopts a “semi-structured ” view of the relational database, modeling a relational data set as a graph o…
- Add To MetaCart
-
Statistical Synopses for Graph-Structured XML Databases
- …Effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows path navigation and branching through…
- Cited by 35 (2 self) – Add To MetaCart
-
Structure and Value Synopses for XML Data Graphs
- …All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XML data graph, and (2) predicates on the values of specific path/branch nodes, in order to reach the desired data ele…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
