The SCEAS System
Navigation Menu

Search the dblp DataBase


Benny Kimelfeld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv
    Interconnection semantics for keyword search in XML. [Citation Graph (0, 0)][DBLP]
    CIKM, 2005, pp:389-396 [Conf]
  2. Benny Kimelfeld, Yehoshua Sagiv
    Efficiently Enumerating Results of Keyword Search. [Citation Graph (0, 0)][DBLP]
    DBPL, 2005, pp:58-73 [Conf]
  3. Benny Kimelfeld, Yehoshua Sagiv
    Combining Incompleteness and Ranking in Tree Queries. [Citation Graph (0, 0)][DBLP]
    ICDT, 2007, pp:329-343 [Conf]
  4. Benny Kimelfeld, Yehoshua Sagiv
    Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    NGITS, 2006, pp:141-152 [Conf]
  5. Benny Kimelfeld, Yehoshua Sagiv
    Finding and approximating top-k answers in keyword proximity search. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:173-182 [Conf]
  6. Sara Cohen, Itzhak Fadida, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv
    Full Disjunctions: Polynomial-Delay Iterators in Action. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:739-750 [Conf]
  7. Benny Kimelfeld, Yehoshua Sagiv
    Efficient Engines for Keyword Proximity Search. [Citation Graph (0, 0)][DBLP]
    WebDB, 2005, pp:67-72 [Conf]
  8. Benny Kimelfeld, Eitan Kovacs, Yehoshua Sagiv, Dan Yahav
    Using Language Models and the HITS Algorithm for XML Retrieval. [Citation Graph (0, 0)][DBLP]
    INEX, 2006, pp:253-260 [Conf]
  9. Benny Kimelfeld, Yehoshua Sagiv
    Maximally joining probabilistic data. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:303-312 [Conf]
  10. Benny Kimelfeld, Yehoshua Sagiv
    Matching Twigs in Probabilistic XML. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:27-38 [Conf]
  11. Benny Kimelfeld, Yehoshua Sagiv
    Twig Patterns: From XML Trees to Graphs. [Citation Graph (0, 0)][DBLP]
    WebDB, 2006, pp:- [Conf]

  12. Revisiting redundancy and minimization in an XPath fragment. [Citation Graph (, )][DBLP]

  13. On rewriting XPath queries using views. [Citation Graph (, )][DBLP]

  14. Querying parse trees of stochastic context-free grammars. [Citation Graph (, )][DBLP]

  15. Probabilistic data exchange. [Citation Graph (, )][DBLP]

  16. Incorporating constraints in probabilistic XML. [Citation Graph (, )][DBLP]

  17. Running tree automata on probabilistic XML. [Citation Graph (, )][DBLP]

  18. Understanding queries in a search database system. [Citation Graph (, )][DBLP]

  19. Transducing Markov sequences. [Citation Graph (, )][DBLP]

  20. Query efficiency in probabilistic XML models. [Citation Graph (, )][DBLP]

  21. Keyword proximity search in complex data graphs. [Citation Graph (, )][DBLP]

  22. ExQueX: exploring and querying XML documents. [Citation Graph (, )][DBLP]

  23. Exploratory keyword search on data graphs. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002