Sciweavers

1018 search results - page 79 / 204
» On the minimization of XPath queries
Sort
View
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 1 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
16 years 2 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
ICFCA
2007
Springer
15 years 7 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
109
Voted
WISE
2002
Springer
15 years 6 months ago
Evaluating and Enhancing Meta-Search Performance in Digital Libraries
Applying meta search systems is a suitable method to support the user if there are many different retrieval services available in the Web. Due to information splitting strategies ...
Bethina Schmitt, Sven Oberländer
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
14 years 5 months ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...