kickass links
garbear
Team-XBMC Developer Joined: Dec 2010 Reputation: 16 Location: gangsta's paradise |
2013-04-11 22:51
Post: #81
kickass links
Always read the XBMC online-manual, FAQ and search the forums before posting. Do NOT e-mail Team-XBMC members asking for support. Read/follow the forum rules. For troubleshooting and bug reporting, make sure you read this first |
| find quote |
topfs2
Team-XBMC Developer Joined: Dec 2007 Reputation: 8 |
2013-04-17 10:50
Post: #82
Since this thread has gotten so much heat as of lately I want to start a discussion on something I simply need some discussion on
![]() The discussion is regarding issue #7 #9 and semi related is #8. The problem is not really the scheduling algorithms (they would need some love but in essence they should work) but more how to reorganize the API of supplies and demands. Basically what we arrive at IMO is a subgraph find and alteration problem, which we in essence had before but with a single node (subject) and its edge. So what I envision is something along the lines of demands: find A where edge(A, owl.sameAs, B) and (B is URL or edge(B, dc.identifier)) As this would allow for this type of owl.sameAs Code: {But I can't find a nice way to produce the above query in python, and in a pythonic way. I'd love it if the demand and supply API was similair aswell, and provided some validation on the output aswell. ATM a task can state it outputs a certain edge and nothing else but when run it can output anything This could potentially break scheduling. So I'd love it if the task missbehave heimdall is able to detect that and just throw away the result ![]() Cheers, Tobias If you have problems please read this before posting Always read the XBMC online-manual, FAQ and search the forum before posting. Do not e-mail XBMC-Team members directly asking for support. Read/follow the forum rules. For troubleshooting and bug reporting please make sure you read this first. ![]() "Well Im gonna download the code and look at it a bit but I'm certainly not a really good C/C++ programer but I'd help as much as I can, I mostly write in C#." |
| find quote |
garbear
Team-XBMC Developer Joined: Dec 2010 Reputation: 16 Location: gangsta's paradise |
2013-05-09 23:05
Post: #83
(2013-05-09 19:49)The Movie Database Wrote:Searching is an important tool for a project like TMDb. Without a good search we end up with duplicates, frustrated users and quite frankly a less than stellar experience. Over the past few years we've had a lot of things change, especially with the amount of non-English content that has been added to our database. We've also grown a lot and our old search infrastructure simply wasn't up for the task.From their facebook page: https://www.facebook.com/themoviedb It looks like they've been working heavily on the search issue as well. With a search engine on their end so heavily optimized in the domain of movies, I'm imagining how much thinking we're going to need to put in to actually contribute anything statistically significant to their results. Always read the XBMC online-manual, FAQ and search the forums before posting. Do NOT e-mail Team-XBMC members asking for support. Read/follow the forum rules. For troubleshooting and bug reporting, make sure you read this first |
| find quote |


![[Image: badge.gif]](http://www.ohloh.net/projects/149/badge.gif)
Search
Help